The following pages link to (Q3211296):
Displaying 23 items.
- Canonicity of weak \(\omega\)-groupoid laws using parametricity theory (Q283766) (← links)
- Bridging Curry and Church's typing style (Q334149) (← links)
- Using typed lambda calculus to implement formal systems on a machine (Q688571) (← links)
- Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics (Q865658) (← links)
- Type checking with universes (Q1177937) (← links)
- Metacircularity in the polymorphic \(\lambda\)-calculus (Q1177938) (← links)
- The extended calculus of constructions (ECC) with inductive types (Q1193601) (← links)
- Coquand's calculus of constructions: A mathematical foundation for a proof development system (Q1201296) (← links)
- From constructivism to computer science (Q1274450) (← links)
- Unification with extended patterns (Q1274966) (← links)
- Higher-order substitutions (Q1854398) (← links)
- Variants of the basic calculus of constructions (Q1885480) (← links)
- A higher-order calculus and theory abstraction (Q2639838) (← links)
- A framework for defining logical frameworks (Q2864157) (← links)
- I Got Plenty o’ Nuttin’ (Q3188289) (← links)
- Termination checking with types (Q4659886) (← links)
- Tactics and Parameters (Q4924546) (← links)
- Type theory as a foundation for computer science (Q5096219) (← links)
- (Q5140267) (← links)
- Modal dependent type theory and dependent right adjoints (Q5220184) (← links)
- Implementing type theory in higher order constraint logic programming (Q5236551) (← links)
- (Q5472887) (← links)
- On the proof theory of Coquand's calculus of constructions (Q5961667) (← links)
