Sciweavers

2000 search results - page 231 / 400
» Program Transformation and Proof Transformation
Sort
View
ICFP
2010
ACM
15 years 5 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
ESOP
2011
Springer
14 years 7 months ago
A New Method for Dependent Parsing
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
Trevor Jim, Yitzhak Mandelbaum
ENTCS
2007
128views more  ENTCS 2007»
15 years 4 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
259
Voted
POPL
2004
ACM
16 years 4 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
PPDP
2009
Springer
15 years 10 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey