Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin

DOI10.1016/0304-3975(93)90089-CzbMath0809.68082OpenAlexW2011935022MaRDI QIDQ1314353

Stephen Brookes

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)90089-c

zbMATH Keywords

concurrent programmingsemantics of programming languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) History of computer science (68-03)

Cites Work

• On stable domains
• An algebraic approach to stable domains
• The system \({\mathcal F}\) of variable types, fifteen years later
• Event structures and domains
• Petri nets, event structures and domains. I
• Sequential algorithms on concrete data structures
• Towards a theory of parallel algorithms on concrete data structures
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Fully abstract semantics for observably sequential languages
• A proof of the Kahn principle for input/output automata
• Recursive domain equations for concrete data structure
• Domain theoretic models of polymorphism
• Minimal and Optimal Computations of Recursive Programs
• A general purpose macrogenerator
• A generalized Kahn Principle for abstract asynchronous networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin