论文信息 - Non-standard reductions and categorical models in typed lambda-calculus - 字舞流文

Non-standard reductions and categorical models in typed lambda-calculus

Sergei Soloviev | D Chemouil | S. Soloviev | F Barral | D. Chemouil | F. Barral

[1] David Chemouil. Types inductifs, isomorphismes et récriture extensionnelle , 2004 .

[2] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[3] Daria Walukiewicz-Chrzaszcz,et al. Termination of rewriting in the Calculus of Constructions , 2003, Journal of Functional Programming.

[4] Peter G. Harrison,et al. Functional Programming , 1988 .

[5] Tobias Nipkow,et al. Term rewriting and all that , 1998 .

[6] David Chemouil,et al. Remarks on isomorphisms of simple inductive types , 2003, Mathematics, Logic and Computation @ ICALP.

[7] Roberto Di Cosmo,et al. On the Power of Simple Diagrams , 1996, RTA.

[8] Nachum Dershowitz,et al. Commutation, Transformation, and Termination , 1986, CADE.

[9] Hendrik Pieter Barendregt,et al. Autarkic Computations in Formal Proofs , 2002, Journal of Automated Reasoning.