βη-equality for coproducts

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

Volumn 902, Issue , 1995, Pages 171-185

  Ghani, Neil ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTABILITY AND DECIDABILITY; DIFFERENTIATION (CALCULUS); PATHOLOGY;

BETA-ETA EQUALITY; CO-PRODUCTS; DECISION PROCEDURE; ELIMINATION RULES; EXPONENTIALS; NORMAL FORM; SIMPLY TYPED LAMBDA CALCULUS; SUBTERMS;

CALCULATIONS;

EID: 84947444601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014052     Document Type: Conference Paper

References (18)

1. Y. Akama, On Mints’ Reduction for ccc-Calculus, in Typed Lambda Calculi and Applications, 1993.
2. H P. Barendregt, The Lambda Calculus Its Syntax and Semantics (Revised Edition) Studies in Logic andthe Foundations of Mathematics 103 (North Holland, 1984).
3. D. Čubrié, On Free CCC, manuscript.
4. N. Dershowitz, J.P. Jouannaud, Rewrite Systems, in The Handbook of Theoretical Computer Science, Elsevier, 1990.
5. R. Di Cosmo and D. Keener, A confluent reduction for the extensional typed X-calculus, in Proceedings ICA LP ‘9 S
6. D. Dougherty, Some X-cakuli with categorical sums and products, in Rewriting Techniques and Applications LNCS 690, 137-151.
7. J-Y. Girard, P. Taylor and Y. Lafont, Proofs and Types, Cambridge Tracts in Theoretical Computer Science (Cambridge University Press, 1989).
8. J.W. Gray, Formal category theory: adjointntss for teategories. Lecture Notes in Mathematics 391 (Springer-Verlag, 1974).
9. G. Huet, Résolution d’équations dans des langages d’ordre 1,2, w. Thèse d’Etat, Université de Paris VII, 1976.
10. G. Huet, Abstract Properties and Applications of Term Rewriting Systems, in JACM, Vol. 27, No 4, pp. 797-821, 1980.
11. C.B. Jay, Local adjunctions, J. Pure and Appl. Alg. 53 (1988) 227-238.
12. C.B. Jay, Modelling reduction in confluent categories, in: Proceedings of the Durham Symposium on Applications of Categories in Computer Science, Lecture Note Series 177 (London Mathematics Society, 1992) 143-162.
13. C.B. Jay and N. Ghani, The Virtues of Eta-expansion, to appear in Journal of Functional Programming.
14. J. Lambek and P. Scott, Introduction to higher order categorical logic, Cambridge Studies in Advanced Mathematics 7 (Cambridge Univ. Press, 1986).
15. G.E. Mints, Teorija categorii і teoria dokaz and telstv. I., in: Aktualnye problémy logiki i metodológii naxkey, Kiev, 1070 252-278.
16. D. Prawitz, Ideas and results in proof theory, in: J.E. Fenstad (ed) Proc. tnd Scandinavian Logic Symp. (North-Holland, 1971) 235-307.
17. D.E. Rydeheard and J.G. Stell, Foundations of equational deduction: A categorical treatment of equa-tional proofs and unification algorithms, in: Pitt et al, (eds), Category Theory and Computer Science, Lecture Notes in Computer Science 283 (Springer, 1987) 114-139.
18. R.A.G. Seely, Modelling computations: a t-catcgoricai framework, in: Proceedings of the Second Annual Symposium on Logic in Computer Science (1987).