Sciweavers

153 search results - page 10 / 31
» entcs 2002
Sort
View
ENTCS
2002
78views more  ENTCS 2002»
14 years 10 months ago
ESUIF: An Open Esterel Compiler
I describe a new compiler infrastructure for imperative synchronous languages such as Esterel and ecl. Built on the suif 2 system, it includes a new intermediate representation fo...
Stephen Edwards
ENTCS
2002
72views more  ENTCS 2002»
14 years 10 months ago
The synchronized graphs trace the context-sensitive languages
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result ...
Chloe Rispal
ENTCS
2002
110views more  ENTCS 2002»
14 years 9 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat
ENTCS
2002
104views more  ENTCS 2002»
14 years 10 months ago
A Note on Coalgebras and Presheaves
We show that the category of coalgebras of a wide-pullback preserving endofunctor on a category of presheaves is itself a category of presheaves. This illustrates a connection bet...
James Worrell
ENTCS
2002
118views more  ENTCS 2002»
14 years 10 months ago
Rank 2 Types for Term Graph Rewriting
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
Steffen van Bakel