156 search results - page 6 / 32 » Proving Failure in Functional Logic Programs |
LPAR
1999
Springer
13 years 12 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
JUCS
2006
13 years 7 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
ENTCS
2007
13 years 7 months ago
2007
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
ICALP
2010
Springer
14 years 11 days ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...