scientific article; zbMATH DE number 1531361

zbMath0962.68039MaRDI QIDQ4513578

Thomas Ehrhard

Publication date: 28 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hierarchy of simple types

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Asynchronous games. II: The true concurrency of innocence ⋮ Sequential algorithms and strongly stable functions

Cites Work

• Unnamed Item
• 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
• A theory of sequentiality
• The sequentially realizable functionals
• A relative PCF-definability result for strongly stable functions and some corollaries
• Projecting sequential algorithms on strongly stable functions
• Localisation and interaction in one dimension
• What is a model of the lambda calculus?

This page was built for publication: