Papers
Topics
Authors
Recent
Search
2000 character limit reached

Decidability of higher-order matching

Published 22 Jul 2009 in cs.LO and cs.GT | (0907.3804v3)

Abstract: We show that the higher-order matching problem is decidable using a game-theoretic argument.

Citations (22)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up