Sciweavers

18 search results - page 2 / 4
» Higher-Order Lazy Functional Slicing
Sort
View
LISP
2008
96views more  LISP 2008»
13 years 5 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
13 years 11 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
WCFLP
2005
ACM
13 years 11 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
ENTCS
2008
140views more  ENTCS 2008»
13 years 5 months ago
Functions and Lazy Evaluation in Prolog
There are several proposals for extending Prolog with functional capabilities. The basic idea is to enlarge the language with function definitions that are translated (or expanded...
Juan Rodríguez-Hortalá, Jaime S&aacu...
PEPM
2004
ACM
13 years 10 months ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal