Author:
Baxthe Gilles,van Raamsdonk Femke
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. F. Baxbanera and M. FernSndez. 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.
2. F. Barbanera and M. FernSndez. 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.
3. F. Barbanera and M. Fernández. Intersection type assignment systems with higherorder algebraic rewriting. Theoretical Computer Science, 170(1–2):173–207, 15 December 1996.
4. 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.
5. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, pages 117–309. Oxford Science Publications, 1992. Volume 2.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The relevance of proof-irrelevance;Automata, Languages and Programming;1998