4666 search results - page 68 / 934 » Equations on Timed Languages |
PAPM
2001
Springer
14 years 3 months ago
2001
Springer
This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs – such ...
WIA
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
ESOP
2007
Springer
14 years 5 months ago
2007
Springer
We give an overview of a proof-producing compiler which translates recursion equations, defined in higher order logic, to assembly language. The compiler is implemented and valida...
FP
1991
14 years 2 months ago
1991
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
TAPSOFT
1991
Springer
14 years 2 months ago
1991
Springer
An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. This concept of integration, which ha...