74 search results - page 12 / 15 » Type Inferencing for Polymorphic Order-Sorted Logic Programs |
145
Voted
ENTCS
2002
15 years 2 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
135
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
148
Voted
LOPSTR
2005
Springer
15 years 8 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
121
Voted
AMAI
2008
Springer
15 years 2 months ago
2008
Springer
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
122
Voted
TPHOL
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...