On the subject reduction property for algebraic type systems-Reference-Cited by-同舟云学术

On the subject reduction property for algebraic type systems

Published:1997 Issue: Volume: Page:34-57
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Barthe G.,Mellies P. -A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63172-0_31.pdf

Reference27 articles.

1. S. Abramsky, D. Gabbay, and T. Maibaum, editors. Handbook of Logic in Computer Science. Oxford Science Publications, 1992.

2. T. Altenkirch. Constructions, inductive types and strong normalisation. PhD thesis, Laboratory for the Foundations of Computer Science, University of Edinburgh, 1994.

3. F. Barbanera and M. Fernández. Combining first and higher order rewrite systems with type assignment systems. In M. Bezem and J.-F. Groote, editors, Proceedings of TLCA'93, volume 664 of Lecture Notes in Computer Science, pages 60–74. Springer-Verlag, 1993.

4. F. Barbanera and M. Fernández. Modularity of termination and confluence in combinations of rewrite systems with λω. 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. Fernández, and H. Geuvers. Modularity of strong normalisation and confluence in the algebraic λ-cube. In Proceedings of LICS'94, pages 406–415. IEEE Computer Society Press, 1994.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Eliminating Proofs from Programs;Electronic Notes in Theoretical Computer Science;2002-12

2. Termination of algebraic type systems: The syntactic approach;Algebraic and Logic Programming;1997