156 search results - page 4 / 32 » Proving Failure in Functional Logic Programs |
ENTCS
2007
13 years 7 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
TPHOL
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
ENTCS
2007
13 years 7 months ago
2007
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
PLILP
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
ICLP
1990
Springer
13 years 11 months ago
1990
Springer
Although Warren's method for the evaluation in Prolog of expressions with higherorder functions appears to have been neglected, it is of great value. Warren's paper need...