[Functional Programming] Working with two functors(Applicative Functors)-- Part1 --.ap
What is applicative functor:
the ability to apply functors to each other.
For example we have tow functors: Container(2), Container(3)
// We can't do this because the numbers are bottled up.
add(Container.of(), Container.of()); // NaN
We cannot just add two functors!
Instead we should do:
const map = (fn, m) => m.map(fn);
const containerOfAdd2 = map(add(), Container.of()); // Container(5)
or
Container.of().chain(two => Container.of().map(add(two)));
Previous solution should work. but there are better way to do it:
1. ap
Container.prototype.ap = function (otherContainer) {
return otherContainer.map(this.$value);
};
As you can see, 'ap' takes a fuctor then applya map to it.
We can see ap:
Container.of().map(add).ap(Container.of()); // Container(5)
Or, we add lift 'add(2)' into Container, then apply Container(3):
Container.of(add()).ap(Container.of()); // Container(5)
Because 'add' is partially applied in add(2), when doing '.ap(Container.of(3))', we give the rest input '3' to it.
Now, we can define applicative functor in programming language:
An applicative functor is a pointed functor with an
apmethod
Note the dependence on pointed.
Laws behind:
F.of(x).map(f) === F.of(f).ap(F.of(x))
Main idea is: lift 'f' (function) into Functor, then 'ap' (apply) another Functor with the value (x).
Some example:
Maybe.of(add).ap(Maybe.of()).ap(Maybe.of()) // Just(5)
Task.of(add).ap(Task.of()).ap(Task.of()) // Task(5)
Equals:
Maybe.of(add()).ap(Maybe.of()) // Just(5)
Task.of(add()).ap(Task.of()) // Task(5)
More examples:
// Http.get :: String -> Task Error HTML
const renderPage = curry((destinations, events) => { /* render page */ });
Task.of(renderPage).ap(Http.get('/destinations')).ap(Http.get('/events'));
// Task("<div>some page with dest and events</div>")
// $ :: String -> IO DOM
const $ = selector => new IO(() => document.querySelector(selector)); // getVal :: String -> IO String
const getVal = compose(map(prop('value')), $); // signIn :: String -> String -> Bool -> User
const signIn = curry((username, password, rememberMe) => { /* signing in */ }); IO.of(signIn).ap(getVal('#email')).ap(getVal('#password')).ap(IO.of(false));
// IO({ id: 3, email: 'gg@allin.com' })
----
const R = require('ramda');
class Container {
static of(x) {
return new Container(x);
}
constructor(x) {
this.$value = x;
}
map (fn) {
return Container.of(fn(this.$value));
}
ap (functor) {
return functor.map(this.$value);
}
join() {
return this.$value;
}
chain(fn) {
return this.map(fn).join();
}
inspect() {
return `Container(${this.$value})`;
}
}
class Maybe {
get isNothing() {
return this.$value === null || this.$value === undefined;
}
get isJust() {
return !this.isNothing;
}
constructor(x) {
this.$value = x;
}
inspect() {
return this.isNothing ? 'Nothing' : `Just(${this.$value})`;
}
// ----- Pointed Maybe
static of(x) {
return new Maybe(x);
}
// ----- Functor Maybe
map(fn) {
return this.isNothing ? this : Maybe.of(fn(this.$value));
}
// ----- Applicative Maybe
ap(f) {
return this.isNothing ? this : f.map(this.$value);
}
// ----- Monad Maybe
chain(fn) {
return this.map(fn).join();
}
join() {
return this.isNothing ? this : this.$value;
}
// ----- Traversable Maybe
sequence(of) {
this.traverse(of, identity);
}
traverse(of, fn) {
return this.isNothing ? of(this) : fn(this.$value).map(Maybe.of);
}
}
const add = a => b => a + b;
const map = (fn, m) => m.map(fn);
const notWorking = add(Container.of(2), Container.of(3));
const containerOfAdd2 = map(add(3), Container.of(2));
console.log(containerOfAdd2); // Contianer(5)
const works = Container.of(2).chain(v => Container.of(3).map(add(v)));
console.log(works); // Contianer(5)
const ap = Container.of(2).map(add).ap(Container.of(3));
console.log(ap)
const ap2 = Container.of(add(2)).ap(Container.of(3));
console.log(Maybe.of(add).ap(Maybe.of(2)).ap(Maybe.of(3)))
console.log(Maybe.of(add(2)).ap(Maybe.of(3)))
[Functional Programming] Working with two functors(Applicative Functors)-- Part1 --.ap的更多相关文章
- [Functional Programming] Working with two functors(Applicative Functors)-- Part2 --liftAN
Let's examine a pointfree way to write these applicative calls. Since we know map is equal to of/ap, ...
- UCF Local Programming Contest 2016 J题(二分+bfs)
题目链接如下: https://nanti.jisuanke.com/t/43321 思路: 显然我们要采用二分的方法来寻找答案,给定一个高度如果能确定在这个高度时是否可以安全到达终点,那我们就可以很 ...
- Programming | 中/ 英文词频统计(MATLAB实现)
一.英文词频统计 英文词频统计很简单,只需借助split断句,再统计即可. 完整MATLAB代码: function wordcount %思路:中文词频统计涉及到对"词语"的判断 ...
- Coursera Algorithms Programming Assignment 4: 8 Puzzle (100分)
题目原文:http://coursera.cs.princeton.edu/algs4/assignments/8puzzle.html 题目要求:设计一个程序解决8 puzzle问题以及该问题的推广 ...
- Coursera Algorithms Programming Assignment 3: Pattern Recognition (100分)
题目原文详见http://coursera.cs.princeton.edu/algs4/assignments/collinear.html 程序的主要目的是寻找n个points中的line seg ...
- The 2019 Asia Nanchang First Round Online Programming Contest C. Hello 2019(动态dp)
题意:要找到一个字符串里面存在子序列9102 而不存在8102 输出最小修改次数 思路:对于单次询问 我们可以直接区间dpOn求出最小修改次数 但是对于多次询问 我在大部分题解看到的解释一般是用线段树 ...
- Functional Programming 资料收集
书籍: Functional Programming for Java Developers SICP(Structure and Interpretation of Computer Program ...
- Adaptive AUTOSAR 学习笔记 3 - AP 背景、技术及特征(中文翻译)
本系列学习笔记基于 AUTOSAR Adaptive Platform 官方文档 R20-11 版本.本文从AUTOSAR_EXP_PlatformDesign.pdf开始,一边学习,一边顺带着翻译一 ...
- windows下gVim(Vi/vim)基本使用
Vim 是一个Linux 平台上功能非常强大的编辑器,他是早年的Vi 编辑器的加强版.这个gVim 是windows 版的,并且有了标准的windows 风格的图形界面,所以叫g(graphical) ...
随机推荐
- CTF西湖论剑
一,西湖论剑 itoa()函数有3个参数:第一个参数是要转换的数字,第二个参数是要写入转换结果的目标字符串,第三个参数是转移数字时所用 的基数.在上例中,转换基数为10.10:十进制:2:二进制... ...
- 无框架完整搭建安卓app及其服务端(一)
技术背景: 我的一个项目做的的是图片处理,用 python 实现图片处理的核心功能后,想部署到安卓app中,但是对于一个对安卓和服务器都一知半解的小白来说要现学的东西太多了. 而实际上,我们的项目要求 ...
- 介绍在JSP中如何使用JavaBeans?
在JSP中使用JavaBean常用的动作有: 1)<jsp:useBean />:用来创建和查找bean对象: 2)<jsp:setProperty />:用来设置bean的属 ...
- iOS 9音频应用播放音频之iOS 9音频播放进度
iOS 9音频应用播放音频之iOS 9音频播放进度 iOS 9音频应用开发播放进度 音频文件在播放后经过了多久以及还有多久才可以播放完毕,想必是用户所关注的问题.为了解决这一问题,在很多的音乐播放器中 ...
- FastReport.Net使用:[5]主从表
主从报表在日常生活中也很常用,譬如订单,班级学生报表等.下面以学生选课为例,以学生为主表,选课为从表做一学生选课报表. 绘制简单主从报表 1.绘制报表标题. 2.为数据区添加从表. ●可以直接右键数据 ...
- 【BZOJ 2007】 2007: [Noi2010]海拔 (平面图转对偶图+spfa)
2007: [Noi2010]海拔 Time Limit: 20 Sec Memory Limit: 552 MBSubmit: 2504 Solved: 1195 Description YT市 ...
- 【贪心】【高精度】zoj3987 Numbers
题意:给你一个数n,让你找m个非负整数,使得它们的和为n,并且按位或起来以后的值最小化.输出这个值. 从高位到低位枚举最终结果,假设当前是第i位,如果m*(2^i-1)<n的话,那么说明这一位如 ...
- [转]php-fpm - 启动参数及重要配置详解
约定几个目录/usr/local/php/sbin/php-fpm/usr/local/php/etc/php-fpm.conf/usr/local/php/etc/php.ini 一,php-fpm ...
- bzoj 2055: 80人环游世界 -- 上下界网络流
2055: 80人环游世界 Time Limit: 10 Sec Memory Limit: 64 MB Description 想必大家都看过成龙大哥的<80天环游世界>,里面 ...
- 事务有哪些特性?spring的事务管理有几种方式实现,如何实现?
特性:1.原子性:一个事务中所有对数据库的操作是一个不可分割的操作序列,要么全做要么全不做 2.一致性:数据不会因为事务的执行而遭到破坏 3.隔离性:一个事物的执行,不受其他事务的干扰,即并发执行的事 ...