The following pages link to (Q3138540):
Displaying 16 items.
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060) (← links)
- Adding algebraic rewriting to the untyped lambda calculus (Q1207945) (← links)
- Simply-typed underdeterminism (Q1273067) (← links)
- General recursive functions in a very simply interpretable typed \(\lambda\)-calculus (Q1314352) (← links)
- Categorical abstract machines for higher-order typed \(\lambda\)-calculi (Q1349667) (← links)
- Some lambda calculus and type theory formalized (Q1961921) (← links)
- A category theoretic formulation for Engeler-style models of the untyped \(\lambda\)-calculus (Q2863881) (← links)
- (Q3024838) (← links)
- (Q3194765) (← links)
- Order-enriched sketches for typed lambda calculi (Q3978972) (← links)
- Pruning simply typed -terms (Q4716047) (← links)
- Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> (Q4764617) (← links)
- A partial evaluator for the untyped lambda-calculus (Q4939696) (← links)
- Decomposing typed lambda calculus into a couple of categorical programming languages (Q5057475) (← links)
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search (Q5236550) (← links)
- Clones, closed categories, and combinatory logic (Q6629524) (← links)
