Sciweavers

ENTCS
2002
92views more  ENTCS 2002»
13 years 4 months ago
Improving the Efficiency of Non-Deterministic Computations
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
Sergio Antoy, Pascual Julián Iranzo, Bart M...
ENTCS
2007
114views more  ENTCS 2007»
13 years 4 months ago
Reporting Failures in Functional Logic Programs
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
Michael Hanus
ENTCS
2007
113views more  ENTCS 2007»
13 years 4 months ago
The Interactive Curry Observation Debugger iCODE
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...
Parissa H. Sadeghi, Frank Huch
LPAR
1999
Springer
13 years 9 months ago
A Partial Evaluation Framework for Curry Programs
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...
Elvira Albert, María Alpuente, Michael Hanu...
ICFP
1999
ACM
13 years 9 months ago
Specialization of Inductively Sequential Functional Logic Programs
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
María Alpuente, Michael Hanus, Salvador Luc...
CL
2000
Springer
13 years 9 months ago
Proving Failure in Functional Logic Programs
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
Francisco Javier López-Fraguas, Jaime S&aac...
PPDP
2001
Springer
13 years 9 months ago
An Implementation of Narrowing Strategies
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
Sergio Antoy, Michael Hanus, Bart Massey, Frank St...
ICLP
2005
Springer
13 years 10 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
POPL
2002
ACM
14 years 5 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...