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 answers only
not deleted
user 367
Use this tag when asking a question that is not about a specific Lambda-calculus such as pure, typed, etc.
2
votes
Accepted
What is the $\mu$ in the labmda calculus defined here?
What is the $\mu$ in above definition of lambda calculus (what is the associated formal system)?
This system is (a variation of) the language PCF. This language has been a landmark in the study of (de …
- 6,008
1
vote
Why is lambda calculus favoured for formal verification?
To complement Andrej's answer, beyond the Curry-Howard correspondence there is also another important aspect: binding.
One area where λ-calculus shines (and which, as far as I understand, it was origi …
- 6,008
3
votes
Comparison between proof assistants for coinductive structures and proofs
I do not know much about other proof assistants, but as for Coq I can say that there are quite some resources around that you might benefit from. Here is a starting point.
However, the current situati …
- 6,008