Concrete domains

DOI10.1016/0304-3975(93)90090-GzbMath0809.68085OpenAlexW2911979341MaRDI QIDQ1314355

G. Kahn, Gordon D. Plotkin

Publication date: 20 March 1995

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

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90090-g

zbMATH Keywords

domains of computationsemantical domains

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)

Related Items (27)

On the symmetry of sequentiality ⋮ Effective inseparability in a topological setting ⋮ Convergence in infinitary term graph rewriting systems is simple ⋮ A counterexample to Thiagarajan's conjecture on regular event structures ⋮ Game-theoretic analysis of call-by-value computation ⋮ Unnamed Item ⋮ Nondeterminism and infinite computations in constraint programming ⋮ Quasi-prime algebraic domains ⋮ Turing Machines, Transition Systems, and Interaction ⋮ Rabin's theorem in the concurrency setting: a conjecture ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Unnamed Item ⋮ Turing machines, transition systems, and interaction ⋮ True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures ⋮ Concrete data structures and functional parallel programming ⋮ A stable programming language ⋮ Probabilistic event structures and domains ⋮ Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity ⋮ On the construction of free algebras for equational systems ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ ⋮ The sequentially realizable functionals ⋮ Event Domains, Stable Functions and Proof-Nets ⋮ Definability and Full Abstraction ⋮ Event Structures with Symmetry ⋮ Extracting Program Logics From Abstract Interpretations Defined by Logical Relations ⋮ Probabilistic π-Calculus and Event Structures

Uses Software

• LCF
• Lucid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\mathbb{T}^\omega\) as a universal domain
• Edinburgh LCF. A mechanized logic of computation
• Lucid, a nonprocedural language with iteration
• The next 700 programming languages

This page was built for publication: Concrete domains