Hostname: page-component-5c6d5d7d68-wtssw Total loading time: 0 Render date: 2024-08-22T01:59:48.787Z Has data issue: false hasContentIssue false
  • English
  • Français

An operational domain-theoretic treatment of recursive types†

Published online by Cambridge University Press:  19 March 2013

WENG KIN HO
WENG KIN HO*
Affiliation:
Mathematics and Mathematics Education, National Institute of Education, Nanyang Technological University, 1, Nanyang Walk, Singapore 637616, Singapore Email: wengkin.ho@nie.edu.sg
Get access Rights & Permissions [Opens in a new window]

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
Mathematical Structures in Computer Science , Volume 24 , Issue 1 , February 2014 , e240101
Copyright
Copyright © Cambridge University Press 2013 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

†

This work was supported by NTU AcRF under Grant No. RP1-10HWK.

References

Abadi, M. and Fiore, M. (1996) Syntactic considerations on recursive types. In: Proceedings of the 11th Annual IEEE Symposium on Logic In Computer Science, IEEE Computer Society Press 242–252.Google Scholar
Abramsky, S. and Jung, A. (1994) Domain Theory. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of logic in computer science, volume 3: semantic structures, Clarendon Press 1–168.Google Scholar
Birkedal, L. and Harper, R. (1999) Relational Interpretations of Recursive Types in an Operational Setting. Information and Computation 155 3–63.Google Scholar
Escardó, M. H. and Ho, W. K. (2009) Operational domain theory and topology of sequential programming languages. Information and Computation 207 (3)411–437.CrossRefGoogle Scholar
Fiore, M. P. (1996) Axiomatic Domain Theory in Categories of Partial Maps, Ph.D. thesis, University of Edinburgh. Published in 2004 as: Distinguished Dissertations in Computer Science 14, Cambridge University Press.Google Scholar
Fiore, M. P. and Plotkin, G. D. (1994) An Axiomatisation of Computationally Adequate Domain-Theoretic Models of FPC. In: Proceedings of the 10th Annual IEEE Symposium on Logic In Computer Science, IEEE Computer Society Press 92–102.Google Scholar
Fischer, M. and Ladner, R. (1979) Propositional dynamic logic of regular programs. Journal of Computer System Science 18 (2)194–211.Google Scholar
Freyd, P. J. (1990) Recursive types reduced to inductive types. In: Proceedings of the 5th Annual IEEE Symposium on Logic In Computer Science, IEEE Computer Society Press 498–507.Google Scholar
Freyd, P. J. (1991) Algebraically complete categories. In: Smyth, B. and Cunningham, P. (eds.) Advances in Case-Based Reasoning, Proceedings 4th European Workshop, EWCBR-98. Springer-Verlag Lecture Notes in Computer Science 1488 95–104.Google Scholar
Freyd, P. J. (1992) Remarks on algebraically compact categories. In: Fourman, M. P., Johnstone, P. T. and Pitts, A. M. (eds.) Applications of Categories in Computer Science, London Mathematical Society Lecture Note Series 177, Cambridge University Press.Google Scholar
Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M. W. and Scott, D. S. (2003) Continuous Lattices and Domains, Encyclopedia of Mathematics and its Applications 93, Cambridge University Press.Google Scholar
Hennessy, M. C. B. and Ashcroft, E. A. (1980) A mathematical semantics for a nondeterministic typed lambda-calculus. Theoretical Computer Science 11 (3)227–245.Google Scholar
Ho, W. K. (2006a) An Operational Domain-theoretic Treatment of Recursive Types. In: Mislove, M. and Brookes, S. (eds.) Proceedings of the 22nd Conference on Mathematical Foundations in Programming Semantics. Electronic Notes in Theoretical Computer Science 158 237–259.Google Scholar
Ho, W. K. (2006b) An operational domain theory and topology of sequential functional languages, Ph.D. thesis, The University of Brimingham.Google Scholar
Howe, D. J. (1989) Equality in lazy computation systems. In: Proceedings of the 4th Annual Symposium on Logic In Computer Science, IEEE Computer Society Press 198–203.Google Scholar
Howe, D. J. (1996) Proving congruence of bisimulation in functional programming languages. Information and Computation 124 (2)103–112.Google Scholar
Kozen, D. (1983) Results on the propositional μ-calculus. Theoretical Computer Science 27 333–354.Google Scholar
Lassen, S. B. (1998a) Relational Reasoning about Contexts. In: Gordon, A. D. and Pitts, A. M. (eds.) Higher Order Operational Techniques in Semantics, Publications of the Newton Institute series, Cambridge University Press 91–135.Google Scholar
Lassen, S. B. (1998b) Relational Reasoning about Functions and Nondeterminism, Ph.D. thesis, University of Aarhus.CrossRefGoogle Scholar
Mac Lane, S. (1998) Categories for the Working Mathematician, 2nd edition, Springer-Verlag.Google Scholar
Mason, I. A., Smith, S. F. and Talcott, C. L. (1996) From operational semantics to domain theory. Information and Computation 128 (1)26–47.Google Scholar
McCusker, G. (2000) Games and Full Abstraction for FPC. Information and Computation 160 1–61.Google Scholar
Pitts, A. M. (1996) Relational Properties of Domains. Information and Computation 127 66–90.Google Scholar
Pitts, A. M. (1997) Operationally-based theories of program equivalence. In: Dybjer, P. and Pitts, A. (eds.) Semantics and Logics of Computation, Publications of the Newton Institute series, Cambridge University Press 241–298.Google Scholar
Plotkin, G. D. (1977) LCF considered as a programming language. Theoretical Computer Science 5 (1)223–255.Google Scholar
Plotkin, G. D. (1985) Lectures on predomains and partial functions. Notes for a course given at the Center for the Study of Languages and Information, Stanford.Google Scholar
Poigné, A. (1992) Basic category theory. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of logic in computer science, volume 1: Background – Mathematical Structures, Oxford University Press 413–640.Google Scholar
Rohr, A. (2002) A Universal Realizability Model for Sequential Functional Computation, Ph.D. thesis, Technischen Universitat Darmstadt.Google Scholar
Simpson, A. K. (1992) Recursive Types in Kleisli Categories. Available from http://homepages.inf.ed.ac.uk/als/Research.Google Scholar
Simpson, A. K. (1998) Lazy functional algorithms for exact real functionals. In: Brim, L., Gruska, J. and Zlatuška, J. (eds.) Mathematical Foundations of Computer Science 1998: Proceedings 23rd International Symposium, MFCS'98. Springer-Verlag Lecture Notes in Computer Science 1450 323–342.Google Scholar