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 83968
λ-calculus is a formal system for function definition, function application and recursion which forms the mathematical basis of functional programming.
4
votes
2
answers
144
views
Composition of handler types in algebraic effects and handlers
In the paper "An introduction to algebraic effects and handlers" (Pretnar, Matija. Electronic Notes in Theoretical Computer Science 319 (2015): 19-35), handlers get a handler type that looks like a fu …
- 575
2
votes
1
answer
153
views
Optimization of Church-encoded booleans in System F
I can encode booleans in pure lambda calculus like this:
type Bool = forall t. t -> t -> t
true : Bool = \x y -> x
false : Bool = \x y -> y
Is there a procedure to optimize the following "dumb" f …
- 575
5
votes
1
answer
301
views
Abstractions in call-by-push-value
In "Call-by-push-value: A subsuming paradigm." (Levy, Paul Blain. Springer, Dordrecht, 2003. 27-47) terms of the lambda calculus get split in to values and computations, with the slogan "A value is, a …
- 575
2
votes
1
answer
314
views
Call-by-push-value vs Fine-grain Call-by-value
It seems to me that Fine-grain call-by-value already subsumes CBV and CBN, using lambdas as thunks. What does CBPV improve upon FG-CBV or in what way is it "better"?
- 575
3
votes
0
answers
565
views
Type inference for System F-omega
There have been some nice papers about simple type inference for System F: "HMF: Simple Type Inference for First-Class Polymorphism", "Practical type inference for arbitrary-rank types", and "Complete …
- 575
3
votes
0
answers
117
views
Calculus of constructions, type-in-type and recursion
Does adding type-in-type to the calculus of constructions lead to (general) recursion? Such that one can write the Y combinator.
- 575
5
votes
1
answer
104
views
What untyped term inhabits induction on natural numbers in CoC?
Induction on Church-encoded natural numbers (which I will call indNat) can not be defined within the Calculus of Constructions.
If we assumed indNat as an axiom, is there an untyped term that would h …
- 575