The following pages link to Concrete domains (Q1314355):
Displaying 34 items.
- Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
- Quasi-prime algebraic domains (Q672133) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
- On the construction of free algebras for equational systems (Q1014644) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Spatio-temporal domains: an overview (Q1623136) (← links)
- A theory of sequentiality (Q1802073) (← links)
- Recursive domain equations for concrete data structure (Q1823005) (← links)
- Describing semantic domains with sprouts (Q1823713) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Effective inseparability in a topological setting (Q1923565) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Concurrent semantics for fusions: weak prime domains and connected event structures (Q2051794) (← links)
- A counterexample to Thiagarajan's conjecture on regular event structures (Q2186822) (← links)
- Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
- True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures (Q2490114) (← links)
- A stable programming language (Q2492185) (← links)
- Probabilistic event structures and domains (Q2503038) (← links)
- Exploratory functions on nondeterministic strategies, up to lower bisimilarity (Q2805166) (← links)
- Processes and games (Q2851048) (← links)
- Event domains, stable functions and proof-nets (Q2864146) (← links)
- Definability and full abstraction (Q2864154) (← links)
- Event structures with symmetry (Q2864165) (← links)
- Probabilistic \(\pi\)-calculus and event structures (Q2870289) (← links)
- (Q4513599) (← links)
- Convergence in infinitary term graph rewriting systems is simple (Q4585010) (← links)
- The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ (Q4637682) (← links)
- Turing Machines, Transition Systems, and Interaction (Q4917087) (← links)
- Extracting Program Logics From Abstract Interpretations Defined by Logical Relations (Q5262946) (← links)
- On the symmetry of sequentiality (Q5890040) (← links)
- Concrete data structures and functional parallel programming (Q5941198) (← links)
- Domains via graphs (Q5956841) (← links)
- Monoidal streams for dataflow programming (Q6649486) (← links)
