Sequentiality in an extensional framework

DOI10.1006/INCO.1994.1033zbMath0807.68064OpenAlexW1963626918MaRDI QIDQ1327380

Thomas Ehrhard, Antonio Bucciarelli

Publication date: 18 July 1994

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

Full work available at URL: https://semanticscholar.org/paper/82783c19847f417593b2f2cca7b1e6a5d3695db3

zbMATH Keywords

\(dI\)-domains with coherencestrongly stable functions

Mathematics Subject Classification ID

Error bounds for boundary value problems involving PDEs (65N15) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)

Related Items (13)

Projecting sequential algorithms on strongly stable functions ⋮ Unnamed Item ⋮ Turing Machines, Transition Systems, and Interaction ⋮ On the reification of semantic linearity ⋮ Turing machines, transition systems, and interaction ⋮ A stable programming language ⋮ On the expressive power of first-order boolean functions in PCF ⋮ Non-uniform (hyper/multi)coherence spaces ⋮ Non-Uniform Hypercoherences ⋮ The sequentially realizable functionals ⋮ A relative PCF-definability result for strongly stable functions and some corollaries ⋮ Definability and Full Abstraction ⋮ Relative definability of boolean functions via hypergraphs

This page was built for publication: Sequentiality in an extensional framework