An operational domain-theoretic treatment of recursive types

DOI10.1017/S0960129512001004zbMath1342.68197MaRDI QIDQ5740347

Weng Kin Ho

Publication date: 26 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Operational domain theory and topology of sequential programming languages
• A mathematical semantics for a nondeterministic typed lambda-calculus
• LCF considered as a programming language
• Propositional dynamic logic of regular programs
• Relational interpretations of recursive types in an operational setting.
• Games and full abstraction for FPC.
• Proving congruence of bisimulation in functional programming languages
• From operational semantics to domain theory
• Relational properties of domains

This page was built for publication: An operational domain-theoretic treatment of recursive types