On the subject reduction property for algebraic type systems

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

Volumn 1258, Issue , 1997, Pages 34-57

  Barthe, G ^a   Mellies P A ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; RECONFIGURABLE HARDWARE; SYNTACTICS;

GENERAL THEORY; LAMBDA-CALCULI; NORMALISATION; REWRITING SYSTEMS; SUBJECT REDUCTION; TYPE SYSTEMS;

COMPUTER CIRCUITS;

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

References (27)

1. S. Abramsky, D. Gabbay, and T. Maibaum, editors. Handbook of Logic in Com­puter Science. Oxford Science Publications, 1992.
2. T. Altenkirch. Constructions, inductive types and strong normalisation. PhD the­sis, Laboratory for the Foundations of Computer Science, University of Edinburgh, 1994.
3. F. Barbanera and M. Fernandez. Combining first and higher order rewrite systems with type assignment systems. In M.Bezem and J.-F. Groote, editors, Proceed­ings of TLCA’93, volume 664 of Lecture Notes in Computer Science, pages 60-74. Springer-Verlag, 1993.
4. F. Barbanera and M. Fernandez. Modularity of termination and confluence in combinations of rewrite systems with Xu. In A. Lingas, R. Karlsson, and S. Karlsson, editors, Proceedings of ICALP’93, volume 700 of Lecture Notes in Computer Science, pages 657-668. Springer-Verlag, 1993.
5. F. Barbanera, M. Fernandez, and H. Geuvers. Modularity of strong normalisation and confluence in the algebraic A-cube. In Proceedings of LICS’94, pages 406-415. IEEE Computer Society Press, 1994.
6. H. Barendregt. Lambda calculi with types. In Abramsky et al. [1], pages 117-309. Volume 2.
7. G. Barthe. Extensions of pure type systems. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proceedings of TLCA ’95, volume 902 of Lecture Notes in Com­puter Science, pages 16-31. Springer-Verlag, April 1995.
8. G. Barthe. On strong normalisation of algebraic type systems. In preparation, 1997.
9. G. Barthe and H. Elbers. Towards lean proof checking. In J. Calmet and C. Limongelli, editors, Proceedings of DISCO’96, volume 1128 of Lecture Notes in Computer Science, pages 61-62. Springer-Verlag, 1996.
10. G. Barthe and H. Geuvers. Congruence types. In H. Kleine Buening, editor, Pro­ceedings of CSL’95, volume 1092 of Lecture Notes in Computer Science, pages 36-51. Springer-Verlag, 1996.
11. G. Barthe and H. Geuvers. Modular properties of algebraic type systems. In G. Dowek, J. Heering, K. Meinke, and B. Moller, editors, Proceedings of HOA’95, volume 1074 of Lecture Notes in Computer Science, pages 37-56, Springer-Verlag, 1996.
12. G. Barthe, M. Ruys, and H. Barendregt. A two-level approach towards lean proof- checking. In S. Berardi and M. Coppo, editors, Proceedings of TYPES’95, volume 1158 of Lecture Notes in Computer Science, pages 16-35. Springer-Verlag, 1996.
13. V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings of LICS’88, pages 82-90. IEEE Computer Society Press, 1988.
14. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic strong normalisation. Theoretical Computer Science, 83:3-28, 1990.
15. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic con­fluence. Information and Computation, 114:1-29, 1994.
16. T. Coquand. Pattern matching in type theory. In B. Nordstrom, ed­itor, Informal proceedings of LF’92, pages 66-79, 1992. Available fromhttp://www.dcs.ed.ac.uk/lfcsinfo/research/types-bra/proc/index.html.
17. N. Dershowitz and J-P. Jouannaud. Rewrite systems. In J. van Leeuwen, ed­itor, Formal models and semantics. Handbook of Theoretical Computer Science, volume B, pages 243-320. Elsevier, 1990.
18. M. Fernandez. Modeles de calcul multiparadigmes fondes sur la reecriture. PhD thesis, Universite Paris-Sud Orsay, 1993.
19. H. Geuvers. Logics and type systems. PhD thesis, University of Nijmegen, 1993.
20. J.-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of LICS’91, pages 350-361. IEEE Computer Society Press, 1991.
21. J.-P. Jouannaud and M. Okada. Abstract data type systems. Theoretical Com­puter Science, 173(2):349-391, 28 February 1997.
22. J.W. Klop. Combinatory reduction systems. Number 127 in Mathematical Centre Tracts. CWI, 1980.
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. Num­ber 11 in International Series of Monographs on Computer Science. Oxford Uni­versity Press, 1994.
25. P-A. Mellies and B. Werner. A generic proof of strong normalisation for pure type systems. Manuscript, 1996.
26. F. Muller. Confluence of the lambda calculus with left-linear algebraic rewriting. Information Processing Letters, 41:293-299, 1992.
27. Th. Streicher. Correctness and Completeness of a Categorical Semantics of the Calculus of Constructions. PhD thesis, University of Passau, 1989. Appeared as technical report MIP - 8913.