The following pages link to (Q3741042):
Displaying 15 items.
- A logical approach to stable domains (Q859843) (← links)
- An algebraic approach to stable domains (Q917677) (← links)
- On the implementation of abstract data types by programming language constructs (Q1089793) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Stable neighbourhoods (Q1185012) (← links)
- Towards a theory of parallel algorithms on concrete data structures (Q1194326) (← links)
- \(dI\)--domains as prime information systems (Q1198950) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- On the Jacopini technique (Q1376416) (← links)
- Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus (Q1813498) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency (Q2350494) (← links)
- Equationally fully abstract models of PCF (Q5887519) (← links)
