Prelogical relations

DOI10.1016/S0890-5401(02)93115-9zbMath1012.03039OpenAlexW2911466401MaRDI QIDQ1854557

Furio Honsell, Donald Sannella

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(02)93115-9

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items

Logical relations for monadic types

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of lambda definability in categorical models of implicit polymorphism
• Kripke-style models for typed lambda calculus
• On observational equivalence and algebraic specification
• Toward formal development of programs from algebraic specifications: Implementations revisited
• Kripke logical relations and PCF
• A relational account of call-by-value sequentiality
• λ-definable functionals andβη conversion
• Abstract Interpretation, Logical Relations, and Kan Extensions
• Logical relations and the typed λ-calculus