4340 search results - page 476 / 868 » Formal Methods and Cryptography |
169
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 ...
183
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...
199
click to vote
TYPES
1994
Springer
15 years 10 months ago
1994
Springer
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
143
click to vote
ZUM
1992
Springer
15 years 10 months ago
1992
Springer
software in the form of abstract classes; and the specification elements of the language can also be used in concrete classes to document the implementations and their development ...