Sciweavers

1882 search results - page 37 / 377
» Transformational Programming and Forests
Sort
View
HASKELL
2009
ACM
14 years 5 months ago
Alloy: fast generic transformations for Haskell
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
Neil C. C. Brown, Adam T. Sampson
GPCE
2009
Springer
14 years 3 months ago
A language and framework for invariant-driven transformations
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
Yanhong A. Liu, Michael Gorbovitski, Scott D. Stol...
ENTCS
2006
151views more  ENTCS 2006»
13 years 11 months ago
Extending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
Mike Dodds, Detlef Plump
LPNMR
1997
Springer
14 years 3 months ago
Improving the Alternating Fixpoint: The Transformation Approach
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
Ulrich Zukowski, Burkhard Freitag, Stefan Brass
IWFM
1998
117views Formal Methods» more  IWFM 1998»
14 years 6 days ago
A Case Study on Proving Transformations Correct: Data-Parallel Conversion
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
Stephen Kilpatrick, Maurice Clint, Peter Kilpatric...