Congruence types

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

Volumn 1092, Issue , 1996, Pages 36-51

  Barthe, Gilles ^a,c   Geuvers, Herman ^b,c  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL MECHANICS; COMPUTER CIRCUITS; FORMAL LANGUAGES; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

EQUATIONAL REASONING; EQUATIONAL THEORY; REWRITING SYSTEMS; TERM REWRITING SYSTEMS; THEORETICAL FRAMEWORK; TYPE THEORY;

COMPUTATION THEORY;

EID: 84949183244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61377-3_30     Document Type: Conference Paper

References (27)

1. S. Abramsky, D. Gabbay, and T. Malbaum, editors. Handbook of Logic in Computer Science. Oxford Science Publications, 1992.
2. R. Backhouse, P. Chisholm, and G. Malcolm. Do-it-yourself type theory (part I). BEATCS: Bulletin of the European Association for Theoretical Computer Science, 34:68-110, 1988.
3. R. Backhouse, P. Chisholm, and G. Malcolm. Do-it-yourself type theory (part II). BEATCS: Bulletin of the European Association for Theoretical Computer Science, 35:205-244, 1988.
4. F. Barbanera, M. Fernandez, and It. Geuvers. Modularity of strong normalisation and confluence in the algebraic )λ-cube. In Proceedings of LICS'94, pages 406-415. IEEE Computer Society Press, 1994.
5. H.P. Barendregt. Lambda calculi with types. In Abramsky etal. [1], pages 117-309. Volume 2.
6. G. Barthe. Extensions of pure type systems. In Dezani-Ciancaglini and Plotldn [16], pages 16-31.
7. G. Barthe. Formalising algebra in type theory: fundamentals and applications to group theory. Manuscript. An earlier version appeared as technical report CSIR9508, University of Nijmegen, under the title 'Formalising mathematics in type theory: fundamentals and case studies', 1995.
8. G. Barthe and H. Elbers. Towards lean proof checking. Manuscript, 1996.
9. G. Barthe and H. Geuvers. Modular properties of algebraic pure type systems. In G. Dowek, J. Heering, K. Meinke, and B. MSUer, editors, Proceedings of HOA '95, Lecture Notes in Computer Science. Springer-Verlag, 1996. To appear.
10. G. Barthe, M. Ruys, and H. Barendregt. A two-level approach towards lean proofchecking. In S. Berardi and M. Coppo, editors, Proceeding8 of TYPES'95, Lecture Notes in Computer Science. Springer-Verlag, 1996. To appear.
11. G. Betarte. A machine-assisted proof that the integers form an integral domain. Master's thesis, Department of Computer Science, Chalmers University, 1993.
12. V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings of LICS'88, pages 82-90. IEEE Computer Society Press, 1988.
13. R.L. Constable, S.F. Allen, H.M. Bromley, W.R. Cleaveland, J.F. Cremer, R.W. Harper, D.J. Howe, T.B. Knoblock, N.P. Mendler, P. Panangaden, J.T. Sasaki, and S.F. Smith. Implementing Mathematics with the NuPrl Development System. Prentice-Hall, inc., Englewood Cliffs, New Jersey, first edition, 1986.
14. T. Coquand. Pattern matching in type theory. In B. Nordström, editor, Informal proceedings of LF'92, pages 66-79,1992. Available from http://www.dcs.ed.ac.uk/lfcsinfo/research/types-bra/proc/index.html.
15. N. Dershowitz and J-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Formal models and semantics. Handbook of Theoretical Computer Science, volume B, pages 243-320. Elsevier, 1990.
16. M. Dezani-Ciancaglini and G. Plotkin, editors. Proceedings of Ts '95, volume 902 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
17. It. Geuvers. Logics and type systems. PhD thesis, University of Nijmegen, 1993.
18. H. Geuvers. A short and itexible proof of strong normalisation for the calculus of constructions. In P. Dybjer, B. Nordstr6m, and J. Smith, editors, Proceedings of TYPES'94, volume 996 of Lecture Notes in Computer Science, pages 14-38. Sprlnger-Verlag, 1995.
19. H. Geuvers and B. Werner. On the Church-Rosser property for expressive type systems and its consequence for their metatheoretic study. In Proceedings of LICS'94, pages 320-329. IEEE Computer Society Press, 1994.
20. M. Hofmann. A simple model for quotient types. In Dezani-Ciancaglini and Plotkin [16], pages 216-234.
21. B. Jacobs. Categorical logic and type theory. 199-. Book. In preparation.
22. J-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of LICS'91, pages 350-361. IEEE Computer Society Press1991.
23. J-W. Klop. Term-rewriting systems. In Abramsky et al. [1], pages 1-116. Volume 2.
24. Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. Number 11 in International Series of Monographs on Computer Science. Oxford University Press, 1994.
25. B. Nordström I K. Peterssonl and J. Smith. Programming in Martin-Löf's Type Theory. An Introduction. Number 7 in International Series of Monographs on Computer Science. Oxford University Press, 1990.
26. C. Paulin-Mohring. Inductive definitions in the system Coq. Rules and properties. In M. Bezem and J-F. Groote, editors, Proceedings of TLCA'93, volume 664 of Lecture Notes in Computer Science, pages 328-345. Springer-Verlag, 1993.
27. M.J. Plasmeijer and M.C.J.D. van Eekelen. Clean 1.0 reference manual. Technical report, Department of Computer Science, University of Nijmegen, 1996. In preparation.