Sciweavers

264 search results - page 30 / 53
» entcs 2008
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 months ago
Fusing a Transformation Language with an Open Compiler
Transformation systems such as Stratego/XT provide powerful analysis and transformation frameworks and concise languages for language processing, but instantiating them for every ...
Karl Trygve Kalleberg, Eelco Visser
ENTCS
2008
102views more  ENTCS 2008»
13 years 7 months ago
Encoding Distributed Process Calculi into LMNtal
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
Kazunori Ueda
ENTCS
2008
102views more  ENTCS 2008»
13 years 7 months ago
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
Alexander Kurz, Daniela Petrisan
ENTCS
2008
146views more  ENTCS 2008»
13 years 7 months ago
Complete Laziness: a Natural Semantics
Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a clear operational semantics given by Launchbury. However, modern non-strict functional lan...
François-Régis Sinot
ENTCS
2008
102views more  ENTCS 2008»
13 years 7 months ago
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
Harrie Jan Sander Bruggink