The following pages link to (Q4263880):
Displaying 8 items.
- Semantics of the typed \(\lambda\)-calculus with substitution in a cartesian closed category (Q687575) (← links)
- A calculus for reasoning about software composition (Q1770365) (← links)
- Stackability in the simply-typed call-by-value lambda calculus (Q1818310) (← links)
- Simply typed lambda calculus with first-class environments (Q1894315) (← links)
- Explicit environments (Q2708319) (← links)
- Counting environments and closures (Q4993337) (← links)
- A concrete framework for environment machines (Q5277795) (← links)
- A typed context calculus (Q5958759) (← links)