11 search results - page 1 / 3 » Optimizing Higher-Order Pattern Unification |
102
click to vote
CADE
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Nominal Logic is an extension of first-order logic with equality, name-binding, name-swapping, and freshness of names. Contrarily to higher-order logic, bound variables a...
57
Voted
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
CADE
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
AGP
1999
IEEE
15 years 2 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...