8413 search results - page 91 / 1683 » Ordering Problem Subgoals |
LICS
1994
IEEE
14 years 6 days ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
FSTTCS
1993
Springer
14 years 5 days ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
ICLP
1995
Springer
13 years 11 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
POPL
1995
ACM
13 years 11 months ago
1995
ACM
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...