1320 search results - page 116 / 264 » Efficient Implementation of a Linear Logic Programming Langu... |
125
Voted
CICLING
2003
Springer
15 years 9 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
138
Voted
EMSOFT
2005
Springer
15 years 9 months ago
2005
Springer
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [9] across networks using bounded FIFO queues. The problem is first addressed mat...
123
click to vote
PADL
2004
Springer
15 years 9 months ago
2004
Springer
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
117
Voted
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
136
click to vote
PPDP
2004
Springer
15 years 9 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...