Representing inductively defined sets by wellorderings in Martin-Löf's type theory

Theoretical Computer Science

Volumn 176, Issue 1-2, 1997, Pages 329-335

  Dybjer, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; MATHEMATICAL PROGRAMMING; THEOREM PROVING;

MARTIN LOF'S TYPE THEORY; WELLORDERINGS;

SET THEORY;

EID: 0031118216     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00145-4     Document Type: Article

References (15)

1. R. Backhouse, On the meaning and construction of the rules in Martin-Löf's theory of types, in: Proc. Workshop on General Logic, Edinburgh (February 1987). Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1988. ECS-LFCS-88-52.
2. T. Coquand and C. Paulin, Inductively defined types, preliminary version, in: Lecture Notes in Computer Science, Vol. 417, COLOG '88, Internat. Conf. on Computer Logic (Springer, Berlin, 1990).
3. P. Dybjer, Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics, in: Logical Frameworks, (Cambridge Univ. Press, Cambridge, 1991) 280-306.
4. P. Dybjer, Inductive families, Formal Aspects of Comput. (1994) 440-465.
5. H. Geuvers, Inductive and coinductive types with iteration and recursion, manuscript, October 1991.
6. M. Hofmann, Extensional concepts in intensional type theory, Ph.D. Thesis, University of Edinburgh, 1995
7. B. Jacobs, Inductively defined types in dependent type theory, draft version, 1993.
8. Z. Luo, Computation and Reasoning: A Type Theory for Computer Science (Oxford Univ. Press, Oxford, 1994).
9. P. Martin-Löf, Hauptsatz for the intuitionistic theory of iterated inductive definitions, in: J.E. Fenstad, ed., Proc. 2nd Scandinavian Logic Symp. (North-Holland, Amsterdam, 1971) 179-216.
10. P. Martin-Löf, Constructive mathematics and computer programming, in: Logic, Methodology and Philosophy of Science, VI, 1979, North-Holland, Amsterdam, 1982) 153-175.
11. P. Martin-Löf, Intuitionistic Type Theory (Bibliopolis, 1984).
12. N.-P. Mendler, Inductive types via initial algebras, in Martin-Löf type theory, manuscript, July 1990.
13. E. Palmgren, On fixed point operators, inductive definitions and universes in Martin-Löf s type theory, Ph.D. Thesis, Uppsala University, 1991.
14. L.C. Paulson, Proving termination of normalization functions for conditional expressions, J. Automated Reasoning 2 (1986) 63-74.
15. K. Petersson and D. Synek, A set constructor for inductive sets in Martin-Löf's type theory, in: Category Theory and Computer Science, (Springer-Verlag, Lecture Notes in Computer Science, Vol. 389 1989) 128-140.