Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Background, Reserve, and Gandy Machines
| |
|
Background, Reserve, and Gandy Machines
Andreas Blass6  and Yuri Gurevich7
| (6) |
Mathematics Dept., University of Michigan, Ann Arbor, MI 48109-1109, USA |
| (7) |
Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA |
Abstract
The reserve of a state of an abstract state machine was defined to be a “naked set”. In applications, it may be convenient
to have tuples, sets, lists, arrays, etc. defined ahead of time on all elements, including the reserve elements. We generalize
the notion of reserve appropriately. As an application, we solve a foundational problem in Gandy’s formalization of mechanical
devices.
Preparation of this paper was partially supported by a grant from Microsoft Corporation.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|