198 search results - page 12 / 40 » Time Equations for Lazy Functional (Logic) Languages |
117
Voted
ENTCS
2002
15 years 1 months ago
2002
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, n...
130
click to vote
STACS
1999
Springer
15 years 6 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
113
click to vote
PEPM
2010
ACM
15 years 10 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
124
click to vote
AGP
1994
IEEE
15 years 5 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
132
Voted
WFLP
2000
Springer
15 years 5 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...