Computer Science – Logic in Computer Science
Scientific paper
2009-07-22
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.
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-128064