A characterization of lambda definability in categorical models of implicit polymorphism

DOI10.1016/0304-3975(94)00283-OMaRDI QIDQ673121zbMATHOpenAlexFDO

Authors Moez Alimohamed

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

zbMATH Keywords

ccc modelslambda definability

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• scientific article; zbMATH DE number 4027428
• A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
• scientific article; zbMATH DE number 512784
• Categorical semantics for higher order polymorphic lambda calculus
• scientific article; zbMATH DE number 1342278

Cites work

• scientific article; zbMATH DE number 431771 (Why is no real title available?)
• scientific article; zbMATH DE number 3902022 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 4049849 (Why is no real title available?)
• scientific article; zbMATH DE number 4103048 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• scientific article; zbMATH DE number 45228 (Why is no real title available?)
• scientific article; zbMATH DE number 130889 (Why is no real title available?)
• scientific article; zbMATH DE number 515743 (Why is no real title available?)
• scientific article; zbMATH DE number 3342819 (Why is no real title available?)
• A category-theoretic account of program modules
• An intersection problem for finite automata
• Categorical semantics for higher order polymorphic lambda calculus
• Categories for Types
• Kripke logical relations and PCF
• Kripke-style models for typed lambda calculus
• Logical relations and the typed λ-calculus
• Parametricity and local variables
• Types, abstraction, and parametric polymorphism, part 2

Cited in

(7)

• Relative full completeness for bicategorical Cartesian closed structure
• A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
• Logical relations for monadic types
• scientific article; zbMATH DE number 937388 (Why is no real title available?)
• Prelogical relations
• Type-directed specialization of polymorphism.
• Semantic analysis of normalisation by evaluation for typed lambda calculus

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)