Navigation section
fixed point combinator
About this tag
The fixed point combinator is a concept from functional programming and lambda calculus, often used to implement recursion in languages that do not natively support it. On WindowsForum.com, discussions about the fixed point combinator appear in the context of advanced functional programming lectures, such as Dr. Ralf Lämmel's series on Channel 9. These lectures explore language interpretation and the stepwise development of an interpreter for a simple functional language, covering topics like Booleans, natural numbers, lambdas, and recursive lets. The fixed point combinator is a key technique for enabling recursive definitions in such interpreters.
-
Windows 7 C9 Lectures: Dr. Ralf Lämmel - Advanced Functional Programming - Evolution of an Interpreter
In*part*3 of the Advanced Functional Programming lecture series, Dr. Lämmel focuses on the domain of language interpretation as a*method of understanding some important functional programming techniques. As a side effect, some basics of programming language theory are also informally presented...- News
- Thread
- abstract syntax tree advanced topics coding dr. ralf lämmel evolution fixed point combinator functional programming haskell interpreter lambda language theory lecture maybe type monads partiality programming programming lectures recursion stepwise development
- Replies: 0
- Forum: Live RSS Feeds