Remarks on isomorphisms of simple inductive types
暂无分享,去创建一个
[1] Tobias Nipkow,et al. Term rewriting and all that , 1998 .
[2] Jean-Pierre Jouannaud,et al. The Calculus of algebraic Constructions , 1999, RTA.
[3] Burghard von Karger,et al. On the Union of Well-Founded Relations , 1998, Log. J. IGPL.
[4] Jean-Pierre Jouannaud,et al. Inductive-data-type systems , 2002, Theor. Comput. Sci..
[5] Roberto Di Cosmo,et al. Provable isomorphisms of types , 1992, Mathematical Structures in Computer Science.
[6] Christine Paulin-Mohring,et al. Inductive Definitions in the system Coq - Rules and Properties , 1993, TLCA.
[7] J. H. Geuvers. Logics and type systems , 1993 .
[8] Herman Geuvers,et al. The Church-Rosser property for beta eta -reduction in typed lambda -calculi , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[9] Nachum Dershowitz,et al. Commutation, Transformation, and Termination , 1986, CADE.
[10] S. Solov′ev. The category of finite sets and Cartesian closed categories , 1983 .
[11] Zhaohui Luo,et al. Computation and reasoning - a type theory for computer science , 1994, International series of monographs on computer science.
[12] Daria Walukiewicz-Chrzaszcz,et al. Termination of rewriting in the Calculus of Constructions , 2003, Journal of Functional Programming.
[13] Gilles Barthe,et al. Type Isomorphisms and Proof Reuse in Dependent Type Theory , 2001, FoSSaCS.
[14] Roberto Di Cosmo,et al. Isomorphisms of Types , 1995, Progress in Theoretical Computer Science.
[15] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[16] Mariangiola Dezani-Ciancaglini,et al. Characterization of Normal Forms Possessing Inverse in the lambda-beta-eta-Calculus , 1976, Theor. Comput. Sci..