174 search results - page 10 / 35 » Efficient Intensional Implementation for Lazy Functional Lan... |
81
Voted
GI
2009
Springer
15 years 2 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
103
click to vote
ALP
1992
Springer
15 years 1 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
105
Voted
ICFP
1998
ACM
15 years 1 months ago
1998
ACM
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...
82
Voted
PPDP
2004
Springer
15 years 3 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...