A theory of sequentiality

DOI10.1016/0304-3975(93)90005-EzbMath0779.68056MaRDI QIDQ1802073

Antonio Bucciarelli, Thomas Ehrhard

Publication date: 8 August 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

sequential algorithmfunction spacesequentialityDI-domainsequential strucuture

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Related Items (8)

On the symmetry of sequentiality ⋮ Projecting sequential algorithms on strongly stable functions ⋮ Unnamed Item ⋮ On the reification of semantic linearity ⋮ A stable programming language ⋮ Monoidal-closed categories of tree automata ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ A relative PCF-definability result for strongly stable functions and some corollaries

Cites Work

• Linear logic
• Unnamed Item
• Unnamed Item

This page was built for publication: A theory of sequentiality