scientific article
From MaRDI portal
Publication:3741042
zbMath0604.68033MaRDI QIDQ3741042
Jean-Jacques Levy, Pierre-Louis Curien, Gérard Berry
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
formal semanticsoperational semanticsrewriting systemsdenotational semanticsfully abstract modelcpo-enriched cartesian-closed categoriesleast fixed point modelPlotkin's language PCFsyntactic properties
Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) General topics in the theory of software (68N01)
Related Items (22)
Equationally fully abstract models of PCF ⋮ Sequential functions on indexed domains and full abstraction for a sub-language of PCF ⋮ Another approach to sequentiality: Kleene's unimonotone functions ⋮ On the implementation of abstract data types by programming language constructs ⋮ A logical approach to stable domains ⋮ On the Jacopini technique ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ Stable bistructure models of PCF ⋮ Continuous functions and parallel algorithms on concrete data structures ⋮ A monoidal closed category of event structures ⋮ An algebraic approach to stable domains ⋮ Domain theory in logical form ⋮ Stable neighbourhoods ⋮ Towards a theory of parallel algorithms on concrete data structures ⋮ \(dI\)--domains as prime information systems ⋮ Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus ⋮ A Process-Model for Linear Programs ⋮ The sequentially realizable functionals ⋮ Full abstraction for PCF ⋮ Nonexpressibility of fairness and signaling ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
This page was built for publication:
