Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with lambda-calculus
Search options not deleted
user 2909
λ-calculus is a formal system for function definition, function application and recursion which forms the mathematical basis of functional programming.
8
votes
Lambda Calculus Generator
Sure. We can directly generate them according to the definition of lambda terms.
In Haskell, we define the data type first,
data LC a = Var a -- Constructor <type> <type> ...
…
- 299
0
votes
Clear, intuitive derivation of the fixed-point combinator (Y combinator)?
Having a one-step functional $G := (\lambda r.\lambda x.\ \dots r\dots)$ where $r$ is used for a "recursive" call (or calls), the corresponding recursive function denoted by the $\lambda$-term $R$ mu …
- 299