3713 search results - page 396 / 743 » Constructing a Calculus of Programs |
117
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
131
click to vote
ICCL
1998
IEEE
15 years 9 months ago
1998
IEEE
The monadic style of language speci cation has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modi cations in t...
172
click to vote
IFIP
1992
Springer
15 years 8 months ago
1992
Springer
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
138
click to vote
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include ...
129
click to vote
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...