A synthetic theory of sequential domains

DOI10.1016/J.APAL.2011.12.028zbMath1243.68207OpenAlexW1997498689MaRDI QIDQ424548

Thomas Streicher, Bernhard Reus

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

zbMATH Keywords

axiomatic semanticssequentialitysynthetic domain theory

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two models of synthetic domain theory
• 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
• On full abstraction for PCF: I, II and III
• Projecting sequential algorithms on strongly stable functions
• Formalizing synthetic domain theory. The basic definitions
• A fixpoint theorem for complete categories
• Locally Boolean domains
• Impredicativity entails untypedness
• Universality Results for Models in Locally Boolean Domains
• General synthetic domain theory – a logical approach
• A uniform approach to domain theory in realizability models
• On the symmetry of sequentiality

This page was built for publication: A synthetic theory of sequential domains