An operational domain-theoretic treatment of recursive types
From MaRDI portal
(Redirected from Publication:5740347)
An operational domain-theoretic treatment of recursive types (scientific article; zbMATH DE number 6606264)
An operational domain-theoretic treatment of recursive types (scientific article; zbMATH DE number 6606264)
Recommendations
Cites work
- A mathematical semantics for a nondeterministic typed lambda-calculus
- From operational semantics to domain theory
- Games and full abstraction for FPC.
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- LCF considered as a programming language
- Operational domain theory and topology of sequential programming languages
- Propositional dynamic logic of regular programs
- Proving congruence of bisimulation in functional programming languages
- Relational interpretations of recursive types in an operational setting.
- Relational properties of domains
- Results on the propositional \(\mu\)-calculus
Cited in
(8)- Operational domain theory and topology of sequential programming languages
- Relational interpretations of recursive types in an operational setting.
- An operational domain-theoretic treatment of recursive types
- scientific article; zbMATH DE number 179038 (Why is no real title available?)
- scientific article; zbMATH DE number 1251179 (Why is no real title available?)
- scientific article; zbMATH DE number 1088048 (Why is no real title available?)
- Denotational semantics of recursive types in synthetic guarded domain theory
- scientific article; zbMATH DE number 7168147 (Why is no real title available?)
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)
