Sciweavers

144 search results - page 3 / 29
» Nondeterminism Analysis of Functional Logic Programs
Sort
View
ALP
1997
Springer
13 years 10 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
PPDP
2007
Springer
14 years 3 days ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
ICFP
2004
ACM
14 years 6 months ago
Implementing functional logic languages using multiple threads and stores
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...
Andrew P. Tolmach, Sergio Antoy, Marius Nita
APAL
2008
104views more  APAL 2008»
13 years 6 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
ENTCS
2002
83views more  ENTCS 2002»
13 years 5 months ago
Operational Semantics for Functional Logic Languages
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...