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 36037
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
3
votes
Accepted
Question about "Free-ness" of Free SCWF
The way to get a "free" functor rather than an initial object is to allow the $\mathcal B$ in the category $\mathcal B$-Scwfs to vary.
Then there is a forgetful functor $U$ from the category of Scwfs …
- 1,730
8
votes
Accepted
Preservation under Substitution with Telescopes
The property, which I would call "typing of substitution" should hold in any type theory, and is not dependent on the exchange property (which I assume is what you mean by permutation)
The key is tha …
- 1,730