The following pages link to (Q4068706):
Displaying 25 items.
- Extensional models for polymorphism (Q749518) (← links)
- \(\lambda\)-definability of free algebras (Q803116) (← links)
- Kripke-style models for typed lambda calculus (Q804559) (← links)
- A characterization of lambda definable tree operations (Q918191) (← links)
- A family of syntactic logical relations for the semantics of Haskell-like languages (Q1012131) (← links)
- Word operation definable in the typed \(\lambda\)-calculus (Q1099156) (← 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)
- Finitely stratified polymorphism (Q1175334) (← links)
- Characterizing complexity classes by higher type primitive recursive definitions (Q1193623) (← links)
- Intuitionistic propositional logic is polynomial-space complete (Q1259589) (← links)
- The typed lambda-calculus is not elementary recursive (Q1259590) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus (Q1356979) (← links)
- On the semantics of the universal quantifier (Q1371430) (← links)
- Embedding of a free cartesian-closed category into the category of sets (Q1380064) (← links)
- Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus (Q1813498) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- Equality between functionals in the presence of coproducts (Q1854334) (← links)
- Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (Q1919547) (← links)
- What is the meaning of proofs?. A Fregean distinction in proof-theoretic semantics (Q2037304) (← links)
- Substitution structures (Q2295599) (← links)
- Fresh logic: Proof-theory and semantics for FM and nominal techniques (Q2372191) (← links)
- Selective strictness and parametricity in structural operational semantics, inequationally (Q2464947) (← links)
- Extended First-Order Logic (Q3183527) (← links)
- λ-definable functionals andβη conversion (Q3322071) (← links)
