Martin-löf's type theory as an open-ended framework

International Journal of Foundations of Computer Science

Volumn 12, Issue 1, 2001, Pages 31-67

  Tsukada, Yasuyuki ^a   Sato, M ^a  

^a NTT Communication Science Laboratories   (Japan)

Author keywords

bisimulation like equivalences; inductively defined types; Martin L f's type theory; open endedness; partial equivalence relations; structured lazy evaluation systems

Indexed keywords

EID: 33645309716     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054101000400     Document Type: Article

References (48)

1. S. Abramsky, "The lazy lambda-calculus," in Research Topics in Functional Programming, ed. D. A. Turner (Addison-Wesley, Reading, Massachusetts, 1989) pp. 65-116.
2. P. Aczel, 'A general Church-Rosser theorem," Technical Report, University of Manchester, 1978.
3. P. Aczel, "Frege structures and the notions of proposition, truth and set," in The Kleene Symposium, eds. J. Barwise, H. J. Keisler, and K. Kunen (North-Holland, Amsterdam, 1980) pp. 31-59.
4. P. Aczel, Non-Well-Founded Sets (CSLI Publications, Stanford, California, 1988).
5. P. Aczel, D. P. Carlisle, and N. Mendler, "Two frameworks of theories and their implementation in Isabelle," in Logical Frameworks, eds. G. Huet and G. Plotkin (Cambridge University Press, Cambridge, 1991) pp. 3-39.
6. S. F. Allen, "A non-type-theoretic definition of Martin-L6f s types, " in Proc. 2nd IEEE Symp. on Logic in Computer Science, 1987, pp. 215-221.
7. S. F. Allen, "A non-type-theoretic semantics for type-theoretic language," Ph. D. Thesis, Cornell University, 1987.
8. R. Backhouse, P. Chisholm, G. Malcolm, and E. Saaman, "Do-it-yourself type theory," Formal Aspects of Computing 1 (1989) 19-84.
9. J. Barwise and L. S. Moss, Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena (CSLI Publications, Stanford, California, 1996).
10. D. A. Basin and D. J. Howe, "Some normalization properties of Martin-L6f s type theory, and applications," in Proc. 1st Intemat. Conf. on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Vol. 526 (Springer, Berlin, 1991) pp. 475-494.
11. M. J. Beeson, "Recursive models for constructive set theories," Ann. Math. Logic 23 (1982) 127-178.
12. A. Bossi and S. Valentini, "An intuitionistic theory of types with assumptions of high-arity variables," Ann. Pure and Applied Logic 57 (1992) 93-149.
13. R. L. Constable et al., Implementing Mathematics with the Nuprl Proof Development System (Prentice-Hall, Englewood Cliffs, New Jersey, 1986).
14. T. Coquand and C. Paulin, "Inductively defined types," in Proc. Intemat. Conf. on Computer Logic, Lecture Notes in Computer Science, Vol. 417 (Springer, Berlin, 1988) pp. 50-66.
15. P. Dybjer, "Inductive sets and families in Martin-L6f s type theory and their settheoretic semantics," in Logical Frameworks, eds. G. Huet and G. Plot kin (Cambridge University Press, Cambridge, 1991) pp. 280-306.
16. P. Dybjer, "Inductive families," Formal Aspects of Computing 6 (1994) 440-465.
17. P. Dybjer and A. Setzer, "A finite axiomatization of inductive-recursive definitions," in Proc. Jfth Intemat. Conf. on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, Vol. 1581 (Springer, Berlin, 1999) pp. 129-146.
18. S. Feferman, "A language and axioms for explicit mathematics," in Algebra and Logic, Lecture Notes in Mathematics, Vol. 450 (Springer, Berlin, 1975) pp. 87-139.
19. S. Feferman, "Polymorphic typed lambda-calculi in a type-free axiomatic framework," in Logic and Computation, ed. W. Sieg, Contemporary Mathematics, Vol. 106 (American Mathematical Society, Providence, Rhode Island, 1990) pp. 101-136.
20. R. Harper, "Constructing type systems over an operational semantics," J. Symbolic Comput. 14 (1992) 71-84.
21. S. Hayashi and S. Kobayashi, "A new formalization of Feferman's system of functions and classes and its relation to Frege structure," Intemat. J. Foundations Comput. Sci. 6 (1995) 187-202.
22. S. Hayashi and H. Nakano, PX: A Computational Logic (The MIT Press, Cambridge, Massachusetts, 1988).
23. D. J. Howe, "Equality in lazy computation systems," in Proc. J^th IEEE Symp. on Logic in Computer Science, 1989, pp. 198-203.
24. D. J. Howe, "On computational open-endedness in Martin-L6f s type theory," in Proc. 6th IEEE Symp. on Logic in Computer Science, 1991, pp. 162-172.
25. D. J. Howe, "Proving congruence of bisimulation in functional programming languages," Inform, and Comput. 124 (1996) 103-112.
26. G. Kahn, "Natural semantics," in Proc. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 247 (Springer, Berlin, 1987) pp. 22-39.
27. Y. Kameyama, "A type-free theory of half-monotone inductive definitions," Internat. J. Foundations Comput. Sci. 6 (1995) 203-234.
28. Z. Khasidashvili, "The Church-Rosser theorem in orthogonal combinatory reduction systems," INRIA Research Report 1825, INRIA, 1992.
29. J. W. Klop, "Combinatory reduction systems," Mathematical Centre Tracts 127, CWI, 1980.
30. S. Kobayashi and M. Tatsuta, "Realizability interpretation of generalized inductive definitions," Theoret Corn-put. Sci. 131 (1994) 121-138.
31. R. Loader, "Equational theories for inductive types," Ann. Pure and Applied Logic 84 (1997) 175-217.
32. P. Martin-Lof, "Hauptsatz for the intuitionistic theory of iterated inductive definitions," in Proc. 2nd Scandinavian Logic Symposium, ed. J. E. Fenstad (North-Holland, Amsterdam, 1971) pp. 179-216.
33. P. Martin-Lof, "Constructive mathematics and computer programming," in Logic, Methodology and Philosophy of Science VI, eds. L. J. Cohen, J. Los, H. Pfeiffer, and K. P. Podewsky (North-Holland, Amsterdam, 1982) pp. 153-175.
34. P. Martin-Lof, Intuitionistic Type Theory (Bibliopolis, Napoli, 1984).
35. P. Martin-Lof, "Truth of a proposition, evidence of a judgement, validity of a proof," Synthese 73 (1987) 407-420.
36. J. McCarthy, "A basis for a mathematical theory of computations," in Computer Programming and Formal Systems, eds. P. Braffort and D. Hirschberg (North-Holland, Amsterdam, 1963) pp. 33-70.
37. P. F. Mendler and P. Aczel, "The notion of a framework and a framework for LTC," in Proc. 3rd IEEE Symp. on Logic in Computer Science, 1988, pp. 392-399.
38. B. Nordstrom, K. Petersson, and J. M. Smith, Programming in Martin-Lof s Type Theory: An Introduction (Clarendon Press, Oxford, 1990).
39. G. D. Plotkin, "A structural approach to operational semantics," Report DAIMI FN-19, Aarhus University, 1981.
40. M. Sato, "Adding proof objects and inductive definition mechanisms to Frege structures," in Proc. 1st Internat. Conf. on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Vol. 526 (Springer, Berlin, 1991) pp. 53-87.
41. J. Smith, "An interpretation of Martin-Lof s type theory in a type-free theory of propositions," J. Symbolic Logic 49 (1984) 730-753.
42. S. F. Smith, "Hybrid partial-total type theory," Internat. J. Foundations Cornput. Sci. 6 (1995) 235-263.
43. M. Tatsuta, "Program synthesis using realizability," Theoret. Comput. Sci. 90 (1991) 309-353.
44. M. Tatsuta, "Monotone recursive definition of predicates and its realizability interpretation," in Proc. 1st Internat. Conf. on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Vol. 526 (Springer, Berlin, 1991) pp. 38-52.
45. A. S. Troelstra and D. van Dalen, Constructivism in Mathematics: An Introduction, Volumes I and II (North-Holland, Amsterdam, 1988).
46. R. Turner, "Reading between the lines in constructive type theory," J. Logic and Comput. 7 (1997) 229-250.
47. Y. Tsukada, "Open-endedness of objects and types in Martin-Lof s type theory," in Proc. Workshop on Type Theory and its Application to Computer Systems, RIMS Lecture Notes, No. 851 (Research Institute for Mathematical Sciences, Kyoto, 1993) pp. 102-126.
48. Y. Tsukada, "Type-free equational reasoning in the theory of inductively defined types," in Proc. 3rd Fuji Internat. Symp. on Functional and Logic Programming, eds. M. Sato and Y. Toyama (World Scientific, Singapore, 1998) pp. 227-246.