Searching for "Third Order Matching is Decidable" – sorted by Relevance.
5 documents found, showing 1 through 5.
-
Third Order Matching is Decidable
- …Third Order Matching is Decidable Gilles Dowek INRIA-Rocquencourt, B.P. 105, 78153 Le Chesnay…
- Cited by 40 (0 self) – Add To MetaCart
-
Third-Order Matching in the Polymorphic Lambda Calculus
- … that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution…
- Cited by 2 (0 self) – Add To MetaCart
-
Third-Order Matching in the Presence of Type Constructors
- … that it is decidable whether a third-order matching problem in ! (an extension of the simply typed lambda calculus…
- Cited by 3 (1 self) – Add To MetaCart
-
Higher-Order Matching and Tree Automata
- … is irrelevant and hence may be assigned to any term). Third-order matching is again decidable (see [2]), however…
- Cited by 15 (0 self) – Add To MetaCart
-
New Lower Bounds for the Expressiveness and the Higher-Order Matching Problem in the Simply Typed
- … that the third-order matching is decidable. Statman (1982) reduced the higher-order matching to the so…
- Add To MetaCart
Showing 1 through 5.
