28 search results - page 1 / 6 » Typed Higher-Order Narrowing without Higher-Order Strategies |
194
Voted
FLOPS
1999
Springer
15 years 10 months ago
1999
Springer
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
168
Voted
EUROCAST
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an exte...
151
Voted
TPHOL
1997
IEEE
15 years 10 months ago
1997
IEEE
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
162
Voted
WCRE
2005
IEEE
15 years 12 months ago
2005
IEEE
— Chuck is a new code browser that allows navigation of a code base along semantic structures, such as data-flow and higher-order control-flow relationships. Employing the fast...
185
Voted
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...