A characterization of lambda definability in categorical models of implicit polymorphism
From MaRDI portal
Publication:673121
DOI10.1016/0304-3975(94)00283-OzbMATH Open0873.68015OpenAlexW2034606068MaRDI QIDQ673121FDOQ673121
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00283-o
Recommendations
Cites Work
- Title not available (Why is that?)
- Categorical semantics for higher order polymorphic lambda calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Categories for Types
- Parametricity and local variables
- Logical relations and the typed λ-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kripke logical relations and PCF
- Title not available (Why is that?)
- An intersection problem for finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- A category-theoretic account of program modules
- Types, abstraction, and parametric polymorphism, part 2
- Kripke-style models for typed lambda calculus
Cited In (7)
- Prelogical relations
- Type-directed specialization of polymorphism.
- Title not available (Why is that?)
- Relative full completeness for bicategorical Cartesian closed structure
- Logical relations for monadic types
- Semantic analysis of normalisation by evaluation for typed lambda calculus
- A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
This page was built for publication: A characterization of lambda definability in categorical models of implicit polymorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673121)
