Sciweavers

174 search results - page 7 / 35
» Efficient Intensional Implementation for Lazy Functional Lan...
Sort
View
PLILP
1994
Springer
13 years 11 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
PADO
2001
Springer
14 years 4 days ago
Implementing Circularity Using Partial Evaluation
Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy...
Julia L. Lawall
PPDP
2000
Springer
13 years 11 months ago
A model for comparing the space usage of lazy evaluators
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...
Adam Bakewell, Colin Runciman
PADL
1999
Springer
13 years 12 months ago
Beyond Pretty-Printing: Galley Concepts in Document Formatting Combinators
Galleys have been introduced by Jeff Kingston as one of the key concepts underlying his advanced document formatting system Lout. Although Lout is built on a lazy functional progra...
Wolfram Kahl
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
14 years 1 months ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt