Tarski's fixed-pointtheorem and Lambda calculi with monotone inductive types

Synthese

Volumn 133, Issue 1-2, 2002, Pages 107-129

  Matthes, Ralph ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67649197917     PISSN: 00397857     EISSN: 15730964     Source Type: Journal    
DOI: 10.1023/a:1020831825964     Document Type: Article

References (26)

1. Altenkirch, T.: 1999, 'Logical Relations and Inductive/Coinductive Types', in G. Gottlob, E. Grandjean and K. Seyr (eds.), Computer Science Logic 12th International Workshop, Brno, Czech Republic, August 24-28, 1998, Berlin. [Lecture Notes in Computer Science 1584], pp. 343-354.
2. Berger, U.: 1993, 'Program Extraction from Normalization Proofs, in: M. Bezem and J. F. Groóte (eds.), Typed Lambda Calculi and Applications, Berlin. [Lecture Notes in Computer Science 664], pp. 91-106.
3. Eilenberg, S. and Mac Lane, S.: 1942, 'Natural Isomorphisms in Group Theory', Proceedings of the National Academy of Sciences USA 28, pp. 537-543.
4. Geuvers, H.: 1992, 'Inductive and Coinductive Types with Iteration and Recursion', in B. Nordström, K. Pettersson and G. Plotkin (eds.), Proceedings of the 1992 Workshop on Types for Proofs and Programs, Båstad, Sweden, June, pp. 193-217. (Only published via ftp ://ftp.cs.Chalmers.se/pub/ cs-reports/baastad.92/proc.dvi.Z)
5. Girard, J.-Y: 1972, Interprétation Fonctionnelle et Elimination des Coupures dans l'Arithmétique d'Ordre Supérieur, Thèse de Doctorat d'État, Université de Paris VII.
6. Girard, J.-Y., Lafont, Y., and Taylor, P.: 1989, Proofs and Types, Cambridge. [Cambridge Tracts in Theoretical Computer Science 7].
7. Harper, R. and Mitchell, J. C: 1999, 'Parametricky and Variants of Girard's J Operator', Infonnation Processing Letters 70, 1-5.
8. Howard, B.: 1992, 'Fixed Points and Extensionality in Typed Functional Programming Languages', Ph.D. thesis, Stanford University.
9. Howard, W. A.: 1980, 'The Formulae-as-Types Notion of Construction', in J. P. Seldin and J. R. Hindley (eds.), To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Fonnalism, London, pp. 479-190.
10. Mac Lane, S.: 1998, Categories for the Working Mathematician, Berlin. [Graduate Texts in Mathematics 5].
11. Leivant, D.: 1990, 'Contracting Proofs to Programs', in P. Odifreddi (ed.), Logic and Computer Science, London. [APIC Studies in Data Processing 31], pp. 279-327.
12. Matthes, R.: 1998, 'Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types', Doktorarbeit (Ph.D. thesis), University of Munich. (Available via the homepage http://www.tcs. informatik.uni-muenchen. de/matthes)
13. Matthes, R.: 1999a, 'Monotone Fixed-point Types and Strong Normalization', in G. Gottlob, E. Grandjean and K. Seyr (eds.), Computer Science Logic, 12th International Workshop, Brno, Czech Republic, August 24-28, 1998, Berlin.
14. [Lecture Notes in Computer Science 1584], pp. 298-312].
15. Matthes, R.: 1999b, 'Monotone (Co)inductive Types and Positive Fixed-point Types', Theoretical Infonnatics and Applications 33, 309-328 [FICS '98 Proceedings].
16. Mayr, R. and Nipkow, T.: 1998, 'Higher-Order Rewrite Systems and their Confluence', Theoretical Computer Science 192, 3-29.
17. Mendler, N. P.: 1987, 'Recursive Types and Type Constraints in Second-order Lambda Calculus', in Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Ithaca, N.Y., pp. 30-36. (Forms a part of Mendler (1987b).)
18. Mendler, P. F.: 1987b, 'Inductive Definition in Type Theory', Technical Report 87-870, Cornell University, Ithaca, N.Y. (Ph.D. Thesis [Paul F. Mendier = Nax P. Mendier])
19. van de Pol, J. and Schwichtenberg, H.: 1995, 'Strict Functionals for Termination Proofs', in M. Dezani-Ciancaglini and G. Plotkin (eds.), Typed Lambda Calculi and Applications, 2nd International Conference, TLCA '95, Edinburgh, GB, April 10-12, 1995, Proceedings, Berlin. [Lecture Notes in Computer Science 902], pp. 350-364.
20. Reynolds, J. C: 1974, 'Towards a Theory of Type Structure', in B. Robinet (ed.), Programming Symposium, Berlin. [Lecture Notes in Computer Science 19], pp. 408-425.
21. Splawski, Z. and Urzyczyn, P.: 1999, 'Type Fixpoints: Iteration vs. Recursion', in Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming, September 27-29, 1999, Paris, France, ACM Digital Library. http://www.acm.org/pubs/contents/proceedings/fp/317636/.
22. Tait, W. W.: 1967, 'Intensional Interpretations of Functionals of Finite Type I', Journal of Symbolic Logic 32, 198-212.
23. Tait, W. W.: 1975, 'A Readability Interpretation of the Theory of Species', in R. Parikh (ed.), Logic Colloquium Boston 1971/72, Berlin. [Lecture Notes in Mathematics 453], pp. 240-251.
24. Tarski, A.: 1955, 'A Lattice-theoretical Fixpoint Theorem and Its Applications', Pacific Journal of Mathematics 5, 285-309.
25. Uustalu, T.: 1998, 'Natural Deduction for Intuitionistic Least and Greatest Fixedpoint Logics, with an Application to Program Construction', Ph.D. thesis, Royal Institute of Technology, Kista, Sweden.
26. Uustalu, T. and Vene, V.: 1997, 'A Cube of Proof Systems for the Intuitionistic Predicate μ, in M. Haveraaen and O. Owe (eds.), Selected Papers of the 8th Nordic Workshop on Programming Theory (NWPT '96), Oslo, Norway, December 1996, Oslo. [Research Reports, Department of Informatics, University of Oslo 248], pp. 237-246.