论文信息 - Inductive data types: well-ordering types revisited

Inductive data types: well-ordering types revisited

We consider Martin-Lof’s well-ordering type constructor in the context of an impredicative type theory. We show that the well-ordering types can represent various inductive types faithfully in the presence of the filling-up equality rules or η-rules. We also discuss various properties of the filling-up rules. ! " ! # $ % &" '( ) '* + '' + ,. '' " ''/0 % &..'1 " '2 34",5 6 ,5/0 7 % ! 0 " ! # &" '(/ 8 ! " ! # $ % &+ ''/0 9 % 0 : ; % 0 : ! % " ! # $ &?4@,5/0; ! A= $ % -1 &?4@,5/ B B0 7 ! C 9 ) ! AE % 0 % ! 0 ! )

Zhaohui Luo | Healfdene Goguen | H. Goguen | Zhaohui Luo

[1] Corrado Böhm,et al. Automatic Synthesis of Typed Lambda-Programs on Term Algebras , 1985, Theor. Comput. Sci..

[2] J. Paris,et al. The Type Theoretic Interpretation of Constructive Set Theory , 1978 .

[3] N. P. Mendler,et al. Recursive Types and Type Constraints in Second-Order Lambda Calculus , 1987, LICS.

[4] Zhaohui Luo,et al. Program Speciication and Data Reenement in Type Theory , 1991 .

[5] Zhaohui Luo. An extended calculus of constructions , 1990 .

[6] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .

[7] P. Dybjer. Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics , 1991 .

[8] Thierry Coquand,et al. The Calculus of Constructions , 1988, Inf. Comput..

[9] Christian-Emil Ore,et al. The Extended Calculus of Constructions (ECC) with Inductive Types , 1992, Inf. Comput..

[10] Zhaohui Luo,et al. A Higher-Order Calculus and Theory Abstraction , 1991, Inf. Comput..

[11] E. Van Gestel,et al. Programming in Martin-Löf's Type Theory: an Introduction : Bengt Nordström, Kent Petersson and Jan M. Smith Intl. Series of Monographs on Computer Science, Vol. 7, Oxford Science Publications, Oxford, 1990, 231 pages , 1991 .

[12] J. Girard,et al. Proofs and types , 1989 .