No CrossRef data available.
Article contents
An operational domain-theoretic treatment of recursive types†
Published online by Cambridge University Press: 19 March 2013
Abstract
We develop an operational domain theory for treating recursive types with respect to contextual equivalence. The principal approach we take deviates from classical domain theory in that we do not produce the recursive types using the usual inverse limits constructions – we get them for free by working directly with the operational semantics. By extending type expressions to functors between some ‘syntactic’ categories, we establish algebraic compactness. To do this, we rely on an operational version of the minimal invariance property, for which we give a purely operational proof.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2013
Footnotes
This work was supported by NTU AcRF under Grant No. RP1-10HWK.