An operational domain-theoretic treatment of recursive types

DOI10.1017/S0960129512001004zbMATH Open1342.68197MaRDI QIDQ5740347FDOQ5740347

Authors: Weng Kin Ho 

Publication date: 26 July 2016

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

Recommendations

• An operational domain-theoretic treatment of recursive types
• Relational interpretations of recursive types in an operational setting.
• Operational domain theory and topology of sequential programming languages
• From operational semantics to domain theory
• scientific article; zbMATH DE number 16188

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Relational interpretations of recursive types in an operational setting.
• Operational domain theory and topology of sequential programming languages
• An operational domain-theoretic treatment of recursive types
• Denotational semantics of recursive types in synthetic guarded domain theory
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740347)