4036 search results - page 393 / 808 » Formal Methods |
199
Voted
FTRTFT
1998
Springer
15 years 11 months ago
1998
Springer
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...
203
click to vote
IFL
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
171
click to vote
IFL
1997
Springer
15 years 11 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
164
click to vote
IFL
1997
Springer
15 years 11 months ago
1997
Springer
This paper introduces a new compiler optimization called with-loop-folding. It is based on a special loop construct, the withloop, which in the functional language Sac (for Single ...
185
click to vote
IMPERIAL
1993
15 years 11 months ago
1993
This work expounds the notion that (structured) categories are syntax free presentations of type theories, and shows some of the ideas involved in deriving categorical semantics f...