Modularity of termination and confluence in combinations of rewrite systems with λω-Reference-Cited by-同舟云学术

Modularity of termination and confluence in combinations of rewrite systems with λω

Published:1993 Issue: Volume: Page:657-668
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Barbanera Franco,Fernández Maribel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56939-1_110

Reference20 articles.

1. S. van Bakel. Complete restrictions of the intersection type discipline. Theoretical Computer Science, 102:135–163, 1992.

2. F. Barbanera. Adding algebraic rewriting to the calculus of constructions: Strong normalization preserved. In Proc. of the 2nd Int. Workshop on Conditional and Typed Rewriting, LNCS 514, 1990.

3. F. Barbanera. Combining term rewriting and type assignment systems. International Journal of Foundations of Computer Science, 1:165–184, 1990.

4. Franco Barbanera and Maribel Fernàndez. Combining first and higher order rewrite systems with type assignment systems. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, Utrecht, Holland, LNCS 664, 1993.

5. H. Barendregt. Introduction to generalised type systems. Journal of Functional Programming, 1991.

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

1. Inductive-data-type systems;Theoretical Computer Science;2002-02

2. Expanding the Cube;Lecture Notes in Computer Science;1999

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

4. On the subject reduction property for algebraic type systems;Computer Science Logic;1997

5. On modular properties of higher order extensional lambda calculi;Automata, Languages and Programming;1997