Recommendations
Cites work
- scientific article; zbMATH DE number 3950510 (Why is no real title available?)
- scientific article; zbMATH DE number 19486 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1005001 (Why is no real title available?)
- scientific article; zbMATH DE number 1479606 (Why is no real title available?)
- scientific article; zbMATH DE number 1531368 (Why is no real title available?)
- scientific article; zbMATH DE number 1405588 (Why is no real title available?)
- A fixpoint theorem for complete categories
- A uniform approach to domain theory in realizability models
- Axioms and (counter)examples in synthetic domain theory
- Extensional \(\Sigma\)-spaces in type theory
- Formalizing synthetic domain theory. The basic definitions
- Fully abstract semantics for observably sequential languages
- General synthetic domain theory – a logical approach
- Impredicativity entails untypedness
- Locally Boolean domains
- On full abstraction for PCF: I, II and III
- On the symmetry of sequentiality
- Projecting sequential algorithms on strongly stable functions
- The sequentially realizable functionals
- Two models of synthetic domain theory
- Universality Results for Models in Locally Boolean Domains
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)