Extensional embedding of a strongly stable model of PCF

DOI10.1007/3-540-54233-7_123MaRDI QIDQ4036551zbMATH OpenFDO

Authors Antonio Bucciarelli, Thomas Ehrhard

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/3-540-54233-7_123

zbMATH Keywords

denotational semanticsPCFsimply typed functional programming languagesstable semantics

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Recommendations

• Projecting sequential algorithms on strongly stable functions
• scientific article; zbMATH DE number 1531361
• A relative PCF-definability result for strongly stable functions and some corollaries
• A stable programming language
• Sequentiality in an extensional framework

Cited in

(11)

• A relative PCF-definability result for strongly stable functions and some corollaries
• Full abstraction for PCF
• Projecting sequential algorithms on strongly stable functions
• Conflict vs causality in event structures
• A stable programming language
• Characterising spectra of equivalences for event structures, logically
• Intensionally stable functions
• Conflict vs causality in event structures
• Short note preferred extensions are partial stable models
• scientific article; zbMATH DE number 512783 (Why is no real title available?)
• scientific article; zbMATH DE number 1531361 (Why is no real title available?)

This page was built for publication: Extensional embedding of a strongly stable model of PCF

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