87 search results - page 5 / 18 » Functions and Lazy Evaluation in Prolog |
PPDP
2000
Springer
14 years 4 days ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
IFL
1997
Springer
14 years 22 days 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...
JUCS
2007
13 years 8 months ago
2007
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
HASKELL
2009
ACM
14 years 3 months ago
2009
ACM
Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the e...
CEFP
2007
Springer
14 years 2 months ago
2007
Springer
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...