The following pages link to (Q4281485):
Displaying 30 items.
- Automata-theoretic semantics of idealized Algol with passive expressions (Q265826) (← links)
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages (Q280200) (← links)
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Abstraction for concurrent objects (Q615951) (← links)
- A fibrational framework for possible-world semantics of \textsc{Algol}-like languages (Q879351) (← links)
- Core algebra revisited (Q879364) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- Synthetic domain theory and models of linear Abadi {\&} Plotkin logic (Q952487) (← links)
- Structural induction and coinduction in a fibrational setting (Q1275820) (← links)
- Formal parametric polymorphism (Q1314344) (← links)
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
- Parametricity as isomorphism (Q1349670) (← links)
- Polynat in PER models (Q1434360) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- Objects and classes in Algol-like languages (Q1854495) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- Composing dinatural transformations: towards a calculus of substitution (Q2031559) (← links)
- Deriving logical relations from interpretations of predicate logic (Q2133176) (← links)
- Domain-theoretical models of parametric polymorphism (Q2464940) (← links)
- Comprehensive Parametric Polymorphism: Categorical Models and Type Theory (Q2811329) (← links)
- Syntactic Logical Relations for Polymorphic and Recursive Types (Q2864153) (← links)
- From Algebras and Coalgebras to Dialgebras (Q4917045) (← links)
- Proof Nets, Coends and the Yoneda Isomorphism (Q5018492) (← links)
- (Q5111327) (← links)
- (Q5155670) (← links)
- (Q5214814) (← links)
- Universal properties for universal types in bifibrational parametricity (Q5377699) (← links)
- Bifibrational functorial semantics of parametric polymorphism (Q5971398) (← links)
- A logical aspect of parametric polymorphism (Q6560174) (← links)
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms (Q6635503) (← links)
