Difference between revisions of "Combinator"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
Combinator is a kind of [[function]]. All functions can be constructed using two functional abstractions: [[S Combinator]] and [[K Combinator]]<ref name="Scott Part1">{{:Video/Dana Scott - Theory and Models of Lambda Calculus Untyped and Typed - Part 1 of 5 - λC 2017}}</ref><ref extends="Scott Part1">start at 41:32 （[https://youtu.be/mBjhDyHFqJY?t=2492 | Combinator is a kind of [[function]]. All functions can be constructed using two functional abstractions: [[S Combinator]] and [[K Combinator]]<ref name="Scott Part1">{{:Video/Dana Scott - Theory and Models of Lambda Calculus Untyped and Typed - Part 1 of 5 - λC 2017}}</ref><ref extends="Scott Part1">start at 41:32 （[https://youtu.be/mBjhDyHFqJY?t=2492 around 20 second]）</ref>. | ||
Latest revision as of 00:55, 19 January 2022
Combinator is a kind of function. All functions can be constructed using two functional abstractions: S Combinator and K Combinator[1]Cite error: Invalid <ref> tag; invalid names, e.g. too many.
References
- ↑ Scott, Dana (Oct 12, 2017). Dana Scott - Theory and Models of Lambda Calculus Untyped and Typed - Part 1 of 5 - λC 2017. local page: LambdaConf.