Computational adequacy via ‘mixed’ inductive definitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 802 LNCS, Issue , 1994, Pages 72-82

  Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

COMPUTATIONAL ADEQUACY; DENOTATIONAL SEMANTICS; FIXED POINTS; INDUCTIVE DEFINITIONS; MONOTONIC OPERATORS; NEW APPROACHES;

FUNCTIONAL PROGRAMMING;

EID: 85028867228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58027-1_3     Document Type: Conference Paper

References (15)

1. P. J. Freyd. Recursive Types Reduced to Inductive Types. In Proc. 5th Annual Symp. on Logic in Computer Science, Philadelphia, 1990 (IEEE Computer Society Press, Washington, 1990), pp 498-508.
2. P. J. Freyd. Algebraically Complete Categories. In A. Carboni et al (eds), Proc. 1990 Como Category Theory Conference, Lecture Notes in Math. Vol. 1488 (Springer-Verlag, Berlin, 1991), pp 95-104.
3. P. J. Freyd. Remarks on algebraically compact categories. In M. P. Fourman, P. T. Johnstone and A. M. Pitts (eds), Applications of Categories in Computer Science, L.M.S. Lecture Note Series 177 (Cambridge University Press, 1992), pp 95-106.
4. C. A. Gunter. Semantics of Programming Languages. Structures and Techniques. (MIT Press, 1992)
5. A. R. Meyer. Semantical Paradigms: Notes for an Invited Lecture. In Proc. 3rd Annual Symp. on Logic in Computer Science, Edinburgh, 1988 (IEEE Computer Society Press, Washington, 1988), pp 236-255.
6. R. E. Milne. The formal semantics of computer languages and their implementations, Ph.D. Thesis, Univ. Cambridge, 1973.
7. P. W. O’Hearn and R. D. Tennent. Relational Parametricity and Local Variables. In Conf. Record 20th Symp. on Principles of Programming Languages, Charleston, 1993 (ACM, New York, 1993), pp 171-184.
8. A. M. Pitts. A Co-induction Principle for Recursively Defined Domains, Theoretical Computer Science, to appear. (Available as Univ. Cambridge Computer Laboratory Tech. Rept. No. 252, April 1992.)
9. A. M. Pitts. Relational Properties of Recursively Defined Domains. In: Proc. 8th Annual Symp. on Logic in Computer Science, Montréal, 1993 (IEEE Computer Soc. Press, Washington, 1993), pp 86-97.
10. G. D. Plotkin. LCF Considered as a Programming Language, Theoretical Computer Science 5(1977) 223-255.
11. G. D. Plotkin. Lectures on Predomains and Partial Functions. Notes for a course at CSLI, Stanford University, 1985.
12. J. C. Reynolds. On the Relation between Direct and Continuation Semantics. In J. Loeckx (ed.), 2nd Int. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 14 (Springer-Verlag, Berlin, 1974), pp 141-156.
13. D. S. Scott. Domains for Denotational Semantics. In M. Nielsen and E. M. Schmidt (eds), Proc. 9th Int. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 140 (Springer, Berlin, 1982), pp 577-613.
14. M. B. Smyth and G. D. Plotkin. The Category-Theoretic Solution of Recursive Domain Equations, SIAM J. Computing 11(1982) 761-783.
15. G. Winskel. The Formal Semantics of Programming Languages. An Introduction. (MIT Press, 1993)