Intensionally stable functions

DOI10.1007/BFB0023871MaRDI QIDQ2757809zbMATH OpenFDO

Authors Boubakar Gamatie

Publication date 4 December 2001

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

Full work available at URL https://doi.org/10.1007/BFB0023871

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Categorical logic, topoi (03G30) Continuous lattices and posets, applications (06B35)

Recommendations

• Sequentiality in an extensional framework
• A stable programming language
• Full abstraction and the Context Lemma (preliminary report)
• Sequential functions on indexed domains and full abstraction for a sub-language of PCF
• Extensional embedding of a strongly stable model of PCF

Cited in

(3)

• Fully abstract submodels of typed lambda calculi
• On Berry's conjectures about the stable order in PCF
• scientific article; zbMATH DE number 3962228 (Why is no real title available?)

This page was built for publication: Intensionally stable functions

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