Sciweavers

30 search results - page 4 / 6
» Monad Transformers and Modular Interpreters
Sort
View
GI
2009
Springer
13 years 10 months ago
Reinventing Haskell Backtracking
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
Sebastian Fischer
POPL
2009
ACM
14 years 6 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux
NJC
2006
86views more  NJC 2006»
13 years 5 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
CROSSROADS
2006
139views more  CROSSROADS 2006»
13 years 5 months ago
C-Transformers: a framework to write C program transformations
Program transformation techniques have reached a maturity level that allows processing high-level language sources in new ways. Not only do they revolutionize the implementation o...
Alexandre Borghi, Valentin David, Akim Demaille
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 5 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux