Third-order matching in the presence of type constructors-Reference-Cited by-同舟云学术

Third-order matching in the presence of type constructors

Published:1995 Issue: Volume: Page:428-442
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Springintveld Jan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0014069

Reference15 articles.

1. H.P. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 117–309. Oxford Science Publications, 1992.

2. T. Coquand and G. Huet. The calculus of constructions. Information and Control, 76:95–120, 1988.

3. G. Dowek. L'indécidabilité du filtrage du troisième ordre dans les calculs avec types dépendants ou constructeurs de types. Compte Rendu à l'Académie des Sciences, 312, Série I:951–956, 1991. With erratum in: ibid., 318, Série I, p. 873, 1994.

4. G. Dowek. A second-order pattern matching algorithm for the cube of typed λ-calculi. In Mathematical Foundations of Computer Science 91, volume 520 of Lecture Notes in Computer Science, pages 151–160. Springer-Verlag, 1991.

5. G. Dowek. Third order matching is decidable. In Proceedings 7th Annual Symposium on Logic in Computer Science, Santa Cruz, California, 1992.

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

1. Higher Order Unification 30 Years Later;Lecture Notes in Computer Science;2002

2. Higher Order Matching for Program Transformation;Functional and Logic Programming;1999

3. Higher-order matching and tree automata;Computer Science Logic;1998

4. Third-order matching in the polymorphic lambda calculus;Higher-Order Algebra, Logic, and Term Rewriting;1996