Skip to main content
Conference Proceedings

A game-theoretic approach to deciding higher-order matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4052 LNCS 348-359
DOI: 10.1007/11787006_30
8Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We sketch a proof using a game-theoretic argument that the higher-order matching problem is decidable. © Springer-Verlag Berlin Heidelberg 2006.

Author supplied keywords

Cite

CITATION STYLE

APA

Stirling, C. (2006). A game-theoretic approach to deciding higher-order matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 348–359). Springer Verlag. https://doi.org/10.1007/11787006_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free