Decidability of higher-order matching

Details Decidability of higher-order matching Decidability of higher-order matching

2009-07-22

arxiv.org/abs/0907.3804v3

LMCS 5 (3:2) 2009

Computer Science

Logic in Computer Science

appears in LMCS (Logical Methods in Computer Science)

Scientific paper

10.2168/LMCS-5(3:2)2009

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

Affiliated with

Also associated with

No associations

Rating

Decidability of higher-order matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decidability of higher-order matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decidability of higher-order matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-128064