The following pages link to (Q5625124):
Displaying 50 items.
- Strong normalization from an unusual point of view (Q534700) (← links)
- Linear logic (Q579249) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Adjectival and adverbial modification: the view from modern type theories (Q683682) (← links)
- On the expressive power of schemes (Q719245) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- The system \({\mathcal F}\) of variable types, fifteen years later (Q1091379) (← links)
- The calculus of constructions (Q1108266) (← links)
- Toposes and intuitionistic theories of types (Q1115435) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- Metacircularity in the polymorphic \(\lambda\)-calculus (Q1177938) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Adding algebraic rewriting to the untyped lambda calculus (Q1207945) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368) (← links)
- Computational foundations of basic recursive function theory (Q1314348) (← links)
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
- Classical logic, storage operators and second-order lambda-calculus (Q1326769) (← links)
- A general storage theorem for integers in call-by-name \(\lambda\)- calculus (Q1329740) (← links)
- Algebraic proofs of cut elimination (Q1349247) (← links)
- Adequacy for a lazy functional language with recursive and polymorphic types (Q1349683) (← links)
- A domain-theoretic semantics of lax generic functions. (Q1398469) (← links)
- Phase semantics for light linear logic (Q1398478) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- Cut-elimination for a logic with definitions and induction (Q1575931) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Uniform Heyting arithmetic (Q1772775) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- Type-directed specialization of polymorphism. (Q1854317) (← links)
- A sequent calculus for subtyping polymorphic types (Q1854408) (← links)
- Dependent choice, `quote' and the clock (Q1884884) (← links)
- A strong normalization result for classical logic (Q1902976) (← links)
- On Takeuti's early view of the concept of set (Q2097059) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- Graded modal dependent type theory (Q2233475) (← links)
- Deverbal semantics and the Montagovian generative lexicon \(\Lambda \mathsf {Ty}_n\) (Q2255237) (← links)
- Natural language inference in Coq (Q2258817) (← links)
- Burali-Forti as a purely logical paradox (Q2281317) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Term-generic logic (Q2339466) (← links)
- A note on subject reduction in \((\to, \exists)\)-Curry with respect to complete developments (Q2350605) (← links)
- Cut-elimination for quantified conditional logic (Q2363418) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
