Recursive abstract state machines (1997)
Cached
Download Links
by
Yuri Gurevich
,
Karl Stroetmann
| Venue: | J. of Universal Computer Science |
| Citations: | 18 - 4 self |
BibTeX
@ARTICLE{Gurevich97recursiveabstract,
author = {Yuri Gurevich and Karl Stroetmann},
title = {Recursive abstract state machines},
journal = {J. of Universal Computer Science},
year = {1997},
pages = {233--246}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract: As introduced in the Lipari guide, Abstract State Machines (abbreviated as ASMs) are untyped. This is useful for many purposes. However, typed languages have their own advantages. Types structure the data, type checking uncovers errors. Here we propose a typed version of ASMs.
