Syntactic logical relations for polymorphic and recursive types
From MaRDI portal
(Redirected from Publication:2864153)
Recommendations
Cites work
- scientific article; zbMATH DE number 4180818 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 3490449 (Why is no real title available?)
- scientific article; zbMATH DE number 1241702 (Why is no real title available?)
- scientific article; zbMATH DE number 512792 (Why is no real title available?)
- scientific article; zbMATH DE number 2238212 (Why is no real title available?)
- A bisimulation for type abstraction and recursion
- A structural approach to operational semantics
- From operational semantics to domain theory
- LCF considered as a programming language
- Logical relations and the typed λ-calculus
- On the relations between monadic semantics
- Parametric polymorphism and operational equivalence
- Programming Languages and Systems
- Proof of correctness of data representations
- Proving congruence of bisimulation in functional programming languages
- Relational interpretations of recursive types in an operational setting.
- Relational properties of domains
- Semantic types: a fresh look at the ideal model for types
- The Category-Theoretic Solution of Recursive Domain Equations
- The origins of structural operational semantics
Cited in
(23)- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- Correctness of compiling polymorphism to dynamic typing
- scientific article; zbMATH DE number 1251179 (Why is no real title available?)
- A fibrational tale of operational logical relations: pure, effectful and differential
- Logical relations for monadic types
- A logical approach to type soundness
- scientific article; zbMATH DE number 1948186 (Why is no real title available?)
- Exception tracking in an open world
- A case study in programming coinductive proofs: Howe's method
- Combinatory logic with polymorphic types
- Polymorphic type inference for the relational algebra
- Free theorems and runtime type representations
- scientific article; zbMATH DE number 512954 (Why is no real title available?)
- A family of syntactic logical relations for the semantics of Haskell-like languages
- A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go
- Semantic preservation for a type directed translation scheme of Featherweight Go
- Relational interpretations of recursive types in an operational setting.
- Realisability semantics of parametric polymorphism, general references and recursive types
- Typing termination in a higher-order concurrent imperative language
- Parametricity, type equality, and higher-order polymorphism
- Programming Languages and Systems
- On the versatility of open logical relations. Continuity, automatic differentiation, and a containment theorem
- Programming Languages and Systems
This page was built for publication: Syntactic logical relations for polymorphic and recursive types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864153)
