Eta-expansions in Fω

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

Volumn 1258, Issue , 1997, Pages 182-197

  Ghani, Nell ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); RECONFIGURABLE HARDWARE;

BETA-ETA EQUALITY; HIGHER-ORDER; LAMBDA CALCULUS; LAMBDA-CALCULI; NORMAL FORM; REWRITE RULES; REWRITE SYSTEMS; TYPE THEORY;

COMPUTER CIRCUITS;

EID: 84958758464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_39     Document Type: Conference Paper

References (18)

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. H. Baxendregt. The Lambda Calculus: Its Syntax and Semantics (revised edition). Number 103 in Studies in Logic and the Foundations of Mathematics. North Holland, 1984.
3. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting preserves algebraic strong normalisation. Theoretical Computer Science, 83:3-28, 1991.
4. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting preserves algebraic confluence. Information and Computation, 114:1-29, 1994.
5. R. Di Cosmo and D. Kesner. Simulating expansions without expansions. Mathematical Structures in Computer Science, 4:1-48, 1994.
6. R. Di Cosmo and D. Kesner. Combining algebraic rewriting, extensional λ-calcufi and fixpoints. In TGS, 1995.
7. 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.
8. 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.
9. J. Galtier. On girard's candidats de reductibilite. Logic and Computer Science, pages 123-203, 1990.
10. H. Geuvers. The Church-Rosser property for βη -reduction in typed λ-calculi. In LICS, pages 453-460. IEEE, 1992.
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. Reésolution d'équations duns des langages d'ordre 1,2,…,ω. Thèse d'Etat, Université de Paris VII, 1976.
14. C. B. Jay. Modelling reduction in confluent categories. In Applications of Categories in Computer Science, volume 177. London Mathematical Society Lecture Note Series, 1992.
15. 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.
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.
18. R. A. G. Seely. Modelling computations: A 2-categorical framework. In Proc. Snd Annual Symposium on Logic in Computer Science. IEEE publications, 1987.