Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids

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

Volumn 1158 LNCS, Issue , 1996, Pages 47-61

  Beylin, Ilya ^a   Dybjer, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CATEGORY THEORY; CURRY-HOWARD; FORMAL PROOFS; MONOIDAL CATEGORIES; MONOIDS; PROOF ASSISTANT; TYPE THEORY;

ARTIFICIAL INTELLIGENCE;

COMPUTER SCIENCE;

EID: 3042982741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61780-9_61     Document Type: Conference Paper

References (18)

1. P. Aczel. Galois: a theory development project. A report on work in progress for the Turin meeting on the Representation of Logical Frameworks, 1993.
2. S. Agerholm, I. Beylin, and P. Dybjer. A comparison of HOL and ALF formalizations of a categorical coherence theorema. In Theorem Proving in Higher Order Logic (HOL'96). Springer LNCS, 1996. To appear. Available on http://www.cs.chalmers.se/~ilya/FMC/hol-alf.ps.gz.
3. T. Altenkirch, V. Gaspes, B. Nordstrom, and B. von Sydow. A user's guide to ALF. Draft, January 1994.
4. T. Altenkirch, M. Hofmann, and T. Streicher. Categorical reconstruction of a reduction free normalization proof. In D. Pitt, D. E. Rydeheard, and P. Johnstone, editors, Springer LNCS 953, Category Theory and Computer Science, 6th International Conference, CTCS '95, Cambridge, UK, August 1995.
5. U. Berger and H. Schwichtenberg. An inverse to the evaluation functional for typed A-calculus. In Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam, pages 203-211, July 1991.
6. C. Coquand. From semantics to rules: a machine assisted analysis. In E. Borger, Y. Gurevich, and K. Meinke, editors, Proceedings of CSL '93, LNCS 832, 1993.
7. T. Coquand and P. Dybjer. Intuitionistic model constructions and normalization proofs. Preliminary Proceedings of the 1993 TYPES Workshop, Nijmegen, 1993.
8. P. Dybjer. Inductive sets and families in Martin-Lof's type theory and their settheoretic semantics. In Logical Frameworks, pages 280-306. Cambridge University Press, 1991.
9. P. Dybjer. Internal type theory. In TYPES '95, Types for Proofs and Programs, Lecture Notes in Computer Science. Springer, 1996.
10. P. Dybjer and V. Gaspes. Implementing a category of sets in ALF. Manuscript, 1993.
11. Formal proof of coherence theorem. Home page. http://www.cs.Chalmers.se/ ~ilya/FMC/.
12. R. Gordon, A. J. Power, and R. Street. Coherence for tricategories. In Memoirs of the American Mathematical Society. To appear.
13. M. Hedberg. Normalizing the associative law: an experiment with Martin-Lof's type theory. Formal Aspects of Computing, pages 218-252, 1991.
14. M. Hofmann. Elimination of extensionality and quotient types in Martin Löf's type theory. In Types for Proofs and Programs, International Workshop TYPES'93, LNCS 806, 1994.
15. G. Huet. Initiation a la Theorie des Categories. Notes de cours du DEA Fonctionnalite, Structures de Calcul et Programmation donne a l'Universite Paris VII en 1983-84 et 1984-85, 1987.
16. G. Huet and A. Saibi. Constructive category theory. In Proceedings of the Joint CLICS-TYPES Workshop on Categories and Type Theory, Goteborg, January 1995.
17. Y. Lafont. Logique, Categories & Machines. Implantation de Langages de Programmation guidee par la Logique Categorique. PhD thesis, l'Universite Paris VII, January 1988.
18. S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.