Eta-expansions in dependent type theory the calculus of constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1210, Issue , 1997, Pages 164-180

  Ghani, Neil ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; FORMAL LANGUAGES; PATHOLOGY;

BETA-ETA EQUALITY; CALCULUS OF CONSTRUCTION; DEPENDENT TYPE THEORY; DEPENDENT TYPES; NORMAL FORM; TYPE INHABITATIONS; TYPE THEORY;

CALCULATIONS;

EID: 84958956379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62688-3_35     Document Type: Conference Paper

References (17)

1. Y. Akama. On Mints’ reduction for ccc-calculus. In Typed λ-Calculus and Applications, volume 664 of Lecture Notes in Computer Science, pages 1-12. Springer Verlag, 1993.
2. L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67(2-3):173-202, October 1989.
3. R. Di Cosmo. On the power of simple diagrams. To appear in RTA’96.
4. R. Di Cosmo and D. Kesner. Simulating expansions without expansions. Mathematical Structures in Computer Science, 4:1-48, 1994.
5. R. Di Cosmo and D. Kesner. Combining algebraic rewriting, extensional λ-calculi and fixpoints. In TCS, 1995.
6. D. Dougherty. Some λ-calculi with categorical sums and products. In Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 137-151. Springer Verlag, 1993.
7. G. Dowek. On the defintion of the η-long normal form in type systems of the cube. Informal proceedings of the 1993 Workshop on Types for Proofs and Programs, 1993.
8. Alfons Geser. Relative termination. Dissertation, Fakultät für Mathematik und Informatik, Universität Passan, Germany, 1990. Also available as: Report 91-03, Ulmer Informatik-Berichte, Universit:at Ulm, 1991.
9. H. Geuvers. The Church-Rosser property for βη-reduction in typed λ-calculi. In LICS, pages 453-460. IEEE, 1992.
10. ω. To appear in proceedings CSL’96, Utrecht.
11. N. Ghani. Adjoint Rewriting. PhD thesis, University of Edinburgh, Department of Computer Science, 1995.
12. N. Ghani. βη-equality for coproducts. In Typed λ-calculus and Applications, number 902 in Lecture Notes in Computer Science, pages 171-185. Springer Verlag, 1995.
13. G. Huet. Résolution d’équations dans des langages d’ordre 1,2,…,ω. Thèse d’Etat, Université de Paris VII, 1976.
14. C. B. Jay and N. Ghani. The virtues of eta-expansion. Journal of Functional Programming, Volume 5(2), April 1995, pages 135-154. CUP 1995.
15. Jean-Pierre Jouannand and Hélène Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15(4), November 1986.
16. G. E. Mints. Teorija categorii i teoria dokazatelstv.i. Aktualnye problemy logiki i metodologii nauky, pages 252-278, 1979.
17. D. Prawitz. Ideas and results in proof theory. In J.E. Fenstad, editor, Proc. 2nd Scandinavian Logic Symposium, pages 235-307. North Holland, 1971.