Sciweavers

1882 search results - page 92 / 377
» Transformational Programming and Forests
Sort
View
ICFP
2007
ACM
15 years 9 months ago
Call-pattern specialisation for haskell programs
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
Simon L. Peyton Jones
CAV
2009
Springer
165views Hardware» more  CAV 2009»
15 years 1 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...
IWMM
2000
Springer
122views Hardware» more  IWMM 2000»
15 years 1 months ago
Concurrent Garbage Collection Using Program Slices on Multithreaded Processors
We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program s...
Manoj Plakal, Charles N. Fischer
CC
2003
Springer
103views System Software» more  CC 2003»
15 years 3 months ago
A Pattern Matching Compiler for Multiple Target Languages
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
Pierre-Etienne Moreau, Christophe Ringeissen, Mari...
LISP
2006
91views more  LISP 2006»
14 years 9 months ago
Polymorphic typed defunctionalization and concretization
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
François Pottier, Nadji Gauthier