179 search results - page 10 / 36 » Lazy Evaluation for OCL |
105
Voted
SAS
1994
Springer
15 years 6 months ago
1994
Springer
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those t...
121
click to vote
AGTIVE
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
100
Voted
APLAS
2007
ACM
15 years 5 months ago
2007
ACM
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
233
click to vote
ICFP
2009
ACM
16 years 2 months ago
2009
ACM
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
167
Voted
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...