103 search results - page 2 / 21 » Code Generation via Higher-Order Rewrite Systems |
POPL
1995
ACM
13 years 9 months ago
1995
ACM
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
FLOPS
2010
Springer
13 years 4 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
ENTCS
2007
13 years 5 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
ICFP
2007
ACM
13 years 9 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...