The following pages link to (Q3714050):
Displaying 17 items.
- Comparing Hagino's categorical programming language and typed lambda- calculi (Q685425) (← links)
- Semantics of the typed \(\lambda\)-calculus with substitution in a cartesian closed category (Q687575) (← links)
- Kripke-style models for typed lambda calculus (Q804559) (← links)
- E-ccc: between ccc and topos, - its expressive power from the viewpoint of data type theory (Q908685) (← links)
- Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL (Q918956) (← links)
- The linear abstract machine (Q1105351) (← links)
- E-ccc: Between ccc and topos (Q1117018) (← links)
- A set of combinators for abstraction in linear space (Q1821553) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- Reverse AD at higher types: pure, principled and denotationally correct (Q2233481) (← links)
- The maximality of the typed lambda calculus and of cartesian closed categories (Q2724040) (← links)
- Applications of methods of proof theory in category theory. (Q2744122) (← links)
- (Q3142163) (← links)
- (Q3475243) (← links)
- Gödel numberings, principal morphisms, combinatory algebras. A category-theoretic characterization of functional completeness (Q3682463) (← links)
- (Q4856946) (← links)
- Decomposing typed lambda calculus into a couple of categorical programming languages (Q5057475) (← links)
