Sciweavers

87 search results - page 9 / 18
» Functions and Lazy Evaluation in Prolog
Sort
View
PLANX
2008
13 years 10 months ago
XML Stream Processing Using a Lazy Concurrent Language
Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provi...
Shin-Cheng Mu, Ta-Chung Tsai, Keisuke Nakano
PEPM
2010
ACM
14 years 5 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
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...
Fritz Henglein
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 8 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
PADL
2007
Springer
14 years 2 months ago
Rewriting Haskell Strings
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
Duncan Coutts, Don Stewart, Roman Leshchinskiy
ANLP
2000
95views more  ANLP 2000»
13 years 10 months ago
Extracting Molecular Binding Relationships from Biomedical Text
ARBITER is a Prolog program that extracts assertions about macromolecular binding relationships from biomedical text. We describe the domain knowledge and the underspecified lingu...
Thomas C. Rindflesch, Jayant V. Rajan, Lawrence Hu...