198 search results - page 3 / 40 » Time Equations for Lazy Functional (Logic) Languages |
ICFP
2002
ACM
14 years 5 months ago
2002
ACM
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
VLDB
1991
ACM
13 years 9 months ago
1991
ACM
We introduce a persistentfunctional languagecalled PFL which adapts functional programming to the area of deductive databases,much as logic-based deductive databaselanguagesadapt ...
POPL
2008
ACM
14 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...
FPCA
1993
13 years 9 months ago
1993
Five implementations of di erent lazy functional languages are compared using a common benchmark of a dozen medium size programs. The benchmarking procedure has been designed such...
IFL
1997
Springer
13 years 9 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...