3713 search results - page 122 / 743 » Constructing a Calculus of Programs |
102
Voted
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
101
click to vote
ICALP
1997
Springer
15 years 7 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....
103
click to vote
APLAS
2008
ACM
15 years 5 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...
112
click to vote
CC
2003
Springer
15 years 8 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...
111
click to vote
ICFP
2005
ACM
16 years 3 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...