8413 search results - page 43 / 1683 » Ordering Problem Subgoals |
137
click to vote
RTA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
180
click to vote
HOA
1995
15 years 10 months ago
1995
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
179
click to vote
DAM
2008
15 years 6 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
171
click to vote
WG
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
171
click to vote
LICS
2007
IEEE
16 years 23 days ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...