A synthetic theory of sequential domains
From MaRDI portal
Publication:424548
DOI10.1016/J.APAL.2011.12.028zbMATH Open1243.68207OpenAlexW1997498689MaRDI QIDQ424548FDOQ424548
Authors: Bernhard Reus, Thomas Streicher 
Publication date: 1 June 2012
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.12.028
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cites Work
- On full abstraction for PCF: I, II and III
- Title not available (Why is that?)
- A uniform approach to domain theory in realizability models
- A fixpoint theorem for complete categories
- Locally Boolean domains
- Title not available (Why is that?)
- Extensional \(\Sigma\)-spaces in type theory
- Fully abstract semantics for observably sequential languages
- Axioms and (counter)examples in synthetic domain theory
- The sequentially realizable functionals
- Projecting sequential algorithms on strongly stable functions
- Formalizing synthetic domain theory. The basic definitions
- Impredicativity entails untypedness
- Universality Results for Models in Locally Boolean Domains
- Title not available (Why is that?)
- General synthetic domain theory – a logical approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the symmetry of sequentiality
- Two models of synthetic domain theory
Cited In (4)
This page was built for publication: A synthetic theory of sequential domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424548)
