198 search results - page 7 / 40 » Time Equations for Lazy Functional (Logic) Languages |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
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...
PADL
2007
Springer
15 years 5 months ago
2007
Springer
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...
WLP
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents the Kiel Curry System (KiCS) for the lazy functional logic language Curry. Its main features beyond other Curry implementations are: flexible search control by...
133
Voted
FROCOS
2000
Springer
15 years 3 months ago
2000
Springer
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of...
87
Voted
PEPM
2010
ACM
15 years 8 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...