A relative PCF-definability result for strongly stable functions and some corollaries

DOI10.1006/inco.1998.2781zbMath1004.03029OpenAlexW2038883640MaRDI QIDQ1854294

Thomas Ehrhard

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2781

zbMATH Keywords

continuous functionalshierarchy of simple typesPCF-definable functionalstrongly stable functionstrongly stable model

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items

Unnamed Item, Non-Uniform Hypercoherences, Parallel and serial hypercoherences, The sequentially realizable functionals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The system \({\mathcal F}\) of variable types, fifteen years later
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Sequentiality in an extensional framework
• Fully abstract semantics for observably sequential languages
• A theory of sequentiality
• The sequentially realizable functionals
• Projecting sequential algorithms on strongly stable functions
• Localisation and interaction in one dimension
• What is a model of the lambda calculus?
• On the symmetry of sequentiality