Projecting sequential algorithms on strongly stable functions

DOI10.1016/0168-0072(95)00026-7zbMath0852.68027OpenAlexW2011073928MaRDI QIDQ1919532

Thomas Ehrhard

Publication date: 11 December 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00026-7

zbMATH Keywords

strong stabilitysequentialitysequential models of PCF

Mathematics Subject Classification ID

Related Items

A synthetic theory of sequential domains, Unnamed Item, Thick Subtrees, Games and Experiments, Parallel and serial hypercoherences, Sequential algorithms and strongly stable functions, The sequentially realizable functionals, A relative PCF-definability result for strongly stable functions and some corollaries, Full abstraction for PCF

Cites Work

• The system \({\mathcal F}\) of variable types, fifteen years later
• Sequential algorithms on concrete data structures
• A game semantics for linear logic
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Sequentiality in an extensional framework
• A theory of sequentiality
• Localisation and interaction in one dimension
• Games and full completeness for multiplicative linear logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item