Answer1215

摘要： Given a string, find the longest subsequence consisting of a single character. Example: longest("ABAACDDDBBA") should return {'D': 3}. 阅读全文

摘要： We refactor a standard node callback style workflow into a composed task-based workflow. Original Code: Using Task: Using Async: 阅读全文

摘要： Let's examine a pointfree way to write these applicative calls. Since we know map is equal to of/ap, we can write generic functions that will ap as ma 阅读全文

摘要： We examine the data structure Task, see some constructors, familiar methods, and finally how it captures side effects through laziness. We are going t 阅读全文

摘要： We rewrite the Box example using lazy evaulation. Here is Box example: So how to make it as Lazy Box? The Answer is instead of passing a value to the 阅读全文

摘要： Previously we have seen how to use Concat with reduce: To simply this, we can use 'fold': Javascript arrray doesn't have 'fold' so we use immutable-ex 阅读全文

摘要： What is applicative functor: the ability to apply functors to each other. For example we have tow functors: Container(2), Container(3) We cannot just 阅读全文

摘要： Got the idea form this lesson. Not sure whether it is the ncessary, no othere better way to handle it. Have a TodoList component, every time types in 阅读全文

摘要： monoids is a semi-group with a neutral element. A semigroup, it does not have an element to return so it's not a safe operation, whereas with the mono 阅读全文

摘要： Before we introduce what is Monad, first let's recap what is a pointed functor: A pointed functor is a Functor with .of() method Why pointed Functor i 阅读全文