5090 search results - page 52 / 1018 » Constructing Strategies for Programming |
ICALP
1997
Springer
14 years 1 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
APLAS
2008
ACM
13 years 11 months ago
2008
ACM
Researchers repeatedly observed that the module system of ML and the type class mechanism of Haskell are related. So far, this relationship has received little formal investigation...
CC
2003
Springer
14 years 2 months ago
2003
Springer
We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data...
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
APSEC
2005
IEEE
14 years 2 months ago
2005
IEEE
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...