Third-Order Matching in the Presence of Type Constructors
by Unknown Authors
BibTeX
@MISC{_third-ordermatching,
author = {},
title = {Third-Order Matching in the Presence of Type Constructors},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We showthat it is decidable whether a third-order matching problem in! (an extension of the simply typed lambda calculus with type constructors) has a solution or not. We present an algorithm which, given such a problem, returns a solution for this problem if the problem has a solution and returns fail otherwise. We also show that it is undecidable whether a third-order matching problem in! has a closed solution or not. 1
