Pre-logical relations

DOI10.1007/3-540-48168-0_38MaRDI QIDQ4945250zbMATH OpenFDO

Authors Furio Honsell, Donald Sannella

Publication date 25 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48168-0_38

zbMATH Keywords

applicative structuresBasic Lemmacomposabilitydata refinementextensional structuresmodels of typed lambda calculusobservational equivalencepre-logical relations

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• Prelogical relations
• Logical relations for a logical framework
• Logical relations and nondeterminism
• scientific article; zbMATH DE number 1303627
• scientific article; zbMATH DE number 4004155
• scientific article; zbMATH DE number 2063839
• A pretabular classical relevance logic
• Deriving logical relations from interpretations of predicate logic
• scientific article; zbMATH DE number 1722660
• scientific article; zbMATH DE number 4037819

Cited in

(9)

• The sequentially realizable functionals
• Prelogical relations
• scientific article; zbMATH DE number 1670499 (Why is no real title available?)
• scientific article; zbMATH DE number 1722660 (Why is no real title available?)
• scientific article; zbMATH DE number 4145879 (Why is no real title available?)
• An axiomatic approach to binary logical relations with applications to data refinement
• Category theoretic models of data refinement
• Axiomatics for data refinement in call by value programming languages
• Types, Tableaus and Gödel’s God in Isabelle/HOL

This page was built for publication: Pre-logical relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945250)