Sciweavers

650 search results - page 23 / 130
» Logical Bisimulations and Functional Languages
Sort
View
ENTCS
2007
111views more  ENTCS 2007»
13 years 6 months ago
Extra Variables Can Be Eliminated from Functional Logic Programs
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
Javier de Dios Castro, Francisco Javier Lóp...
ALP
1997
Springer
13 years 11 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
ENTCS
2007
120views more  ENTCS 2007»
13 years 6 months ago
A Framework for Interpreting Traces of Functional Logic Computations
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
Bernd Braßel
AIML
2006
13 years 8 months ago
Dynamic topological logics over spaces with continuous functions
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
Boris Konev, Roman Kontchakov, Frank Wolter, Micha...
JUCS
2006
104views more  JUCS 2006»
13 years 6 months ago
Constructive Failure in Functional-Logic Programming: From Theory to Implementation
: Functional-logic programming amalgamates some of the main features of both functional and logic styles into a single paradigm. Nevertheless, negation is a widely investigated fea...
Jaime Sánchez-Hernández