A theory of sequentiality
From MaRDI portal
Publication:1802073
DOI10.1016/0304-3975(93)90005-EzbMATH Open0779.68056MaRDI QIDQ1802073FDOQ1802073
Antonio Bucciarelli, Thomas Ehrhard
Publication date: 8 August 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Semantics in the theory of computing (68Q55)
Cites Work
Cited In (12)
- A relative PCF-definability result for strongly stable functions and some corollaries
- Monoidal-closed categories of tree automata
- Title not available (Why is that?)
- On the symmetry of sequentiality
- Admissible generalisation of temporal sequences as chronicles
- Title not available (Why is that?)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- A syntactic theory of sequential state
- Projecting sequential algorithms on strongly stable functions
- A stable programming language
- Phenomenology of choice sequences
- On the reification of semantic linearity
This page was built for publication: A theory of sequentiality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802073)