scientific article; zbMATH DE number 431761

MaRDI QIDQ3138537zbMATH OpenFDO

Authors Pierre-Louis Curien

Publication date 31 October 1994

zbMATH Keywords

programming languagesfull abstractiondomain theorysequentiality\(\lambda\)- calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 3976319
• scientific article; zbMATH DE number 1549510
• Lambda-calculi for (strict) parallel functions
• Fully abstract semantics for observably sequential languages
• Sequential functions on indexed domains and full abstraction for a sub-language of PCF

Cited in

(9)

• Game-theoretic analysis of call-by-value computation
• Projecting sequential algorithms on strongly stable functions
• Sequentialising nested systems
• Full abstraction for PCF
• Sequential algorithms and strongly stable functions
• Softness of hypercoherences and MALL full completeness
• Game theoretic analysis of call-by-value computation
• Compositionality Entails Sequentializability
• What is sequentiality?

This page was built for publication:

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