Sciweavers

28 search results - page 1 / 6
» Typed Higher-Order Narrowing without Higher-Order Strategies
Sort
View
FLOPS
1999
Springer
13 years 9 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
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...
Sergio Antoy, Andrew P. Tolmach
EUROCAST
2001
Springer
127views Hardware» more  EUROCAST 2001»
13 years 9 months ago
Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations
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...
Tetsuo Ida, Mircea Marin, Taro Suzuki
TPHOL
1997
IEEE
13 years 9 months ago
Type Classes and Overloading in Higher-Order Logic
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...
Markus Wenzel
WCRE
2005
IEEE
13 years 10 months ago
Semantic Navigation of Large Code Bases in Higher-Order, Dynamically Typed Languages
— 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...
S. Alexander Spoon, Olin Shivers
ESOP
2008
Springer
13 years 6 months ago
Practical Programming with Higher-Order Encodings and Dependent Types
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...
Adam Poswolsky, Carsten Schürmann