The following pages link to (Q5610115):
Displayed 22 items.
- Telescopic mappings in typed lambda calculus (Q757027) (← links)
- Realizability and intuitionistic logic (Q792319) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Supporting the formal verification of mathematical texts (Q865656) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- The calculus of constructions (Q1108266) (← links)
- What does logic have to tell us about mathematical proofs? (Q1135835) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- From constructivism to computer science (Q1274450) (← links)
- A unified approach to type theory through a refined \(\lambda\)-calculus (Q1349674) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- On principal types of combinators (Q1583260) (← links)
- Inherited extension of many-sorted theories (Q1816347) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- Towards a computation system based on set theory (Q1825191) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- Understanding uniformity in Feferman's explicit mathematics (Q1899146) (← links)
- Intuitionistic categorial grammar (Q3348895) (← links)
- Inductive-data-type systems (Q5958292) (← links)