Sciweavers

ENTCS
2007
104views more  ENTCS 2007»
13 years 10 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
WFLP
2000
Springer
163views Algorithms» more  WFLP 2000»
14 years 1 months ago
Cooperative Constraint Functional Logic Programming
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constrain...
Mircea Marin, Tetsuo Ida
PADL
2000
Springer
14 years 1 months ago
A Functional Logic Programming Approach to Graphical User Interfaces
We show how the features of modern integrated functional logic programming languages can be exploited to implement graphical user interfaces (GUIs) in a high-level declarative styl...
Michael Hanus
PLILP
1997
Springer
14 years 2 months ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola
ALP
1997
Springer
14 years 2 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
APLAS
2000
ACM
14 years 2 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin
APLAS
2003
ACM
14 years 3 months ago
Constraint Functional Logic Programming for Origami Construction
We describe origami programming methodology based on constraint functional logic programming. The basic operations of origami are reduced to solving systems of equations which desc...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi
JELIA
2004
Springer
14 years 3 months ago
Logic Programs with Functions and Default Values
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...
Pedro Cabalar, David Lorenzo
WCFLP
2005
ACM
14 years 3 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
WCFLP
2005
ACM
14 years 3 months ago
A functional logic database library
Programmers need mechanisms to store application specific data that persists multiple program runs. To accomplish this task, they usually have to deal with storage specific code...
Sebastian Fischer