1598 search results - page 92 / 320 » A Unified Computation Model for Functional and Logic Program... |
238
click to vote
POPL
2008
ACM
16 years 5 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
258
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
138
click to vote
ICDT
2010
ACM
16 years 2 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
128
click to vote
ISCA
1998
IEEE
15 years 9 months ago
1998
IEEE
Microprocessors and memory systems su er from a growing gap in performance. We introduce Active Pages, a computation model which addresses this gap by shifting data-intensive comp...
250
click to vote
PLILP
1993
Springer
15 years 8 months ago
1993
Springer
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...