The following pages link to Extensional models for polymorphism (Q749518):
Displaying 12 items.
- Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Functorial polymorphism (Q753948) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- A modest model of records, inheritance, and bounded quantification (Q922718) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- Inheritance as implicit coercion (Q1175335) (← links)
- Recursive types for Fun (Q1176245) (← links)
- Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus (Q1356979) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (Q1919547) (← links)
- Algebraic types in PER models (Q5887524) (← links)
