ConceptSelf replicatorModified just nowProperties 4Hide BooksChapter 5. The untyped/pure lambda-calculus JourneyProgramming Language Theory Statuslearning Tagslambda calculussemanticsExample:fibo=fix λf. λn. if n=0 or n=1 then 1 else (f (n−1))+(f (n−2))\text{fibo} = \text{fix}\ \lambda f.\ \lambda n.\ \text{if}\ n = 0\ \text{or}\ n = 1\ \text{then}\ 1\ \text{else}\ (f\ (n - 1)) + (f\ (n - 2)) fibo=fix λf. λn. if n=0 or n=1 then 1 else (f (n−1))+(f (n−2)) Previous in ConceptsSelf referenceNext in Concepts Semantic domain