Volume 8, 1996

University of Bialystok

Copyright (c) 1996 Association of Mizar Users

**Noriko Asamoto**- Ochanomizu University, Tokyo
**Yatsuka Nakamura**- Shinshu University, Nagano
**Piotr Rudnicki**- University of Alberta, Edmonton
**Andrzej Trybulec**- Warsaw University, Bialystok

- We define the semantics of macro instructions (introduced in [19]) in terms of executions of ${\bf SCM}_{\rm FSA}$. In a similar way, we define the semantics of macro composition. Several attributes of macro instructions are introduced (paraclosed, parahalting, keeping 0) and their usage enables a systematic treatment of the composition of macro intructions. This article is continued in [1].

This work was partially supported by NSERC Grant OGP9207 and NATO CRG 951368.

- Preliminaries
- Properties of Start-At
- Properties of AMI structures
- Execution of macro instructions
- The composition of macro instructions

- [1]
Noriko Asamoto, Yatsuka Nakamura, Piotr Rudnicki, and Andrzej Trybulec.
On the composition of macro instructions. Part III.
*Journal of Formalized Mathematics*, 8, 1996. - [2]
Grzegorz Bancerek.
Cardinal numbers.
*Journal of Formalized Mathematics*, 1, 1989. - [3]
Grzegorz Bancerek.
The fundamental properties of natural numbers.
*Journal of Formalized Mathematics*, 1, 1989. - [4]
Grzegorz Bancerek and Krzysztof Hryniewiecki.
Segments of natural numbers and finite sequences.
*Journal of Formalized Mathematics*, 1, 1989. - [5]
Grzegorz Bancerek and Piotr Rudnicki.
Development of terminology for \bf scm.
*Journal of Formalized Mathematics*, 5, 1993. - [6]
Grzegorz Bancerek and Andrzej Trybulec.
Miscellaneous facts about functions.
*Journal of Formalized Mathematics*, 8, 1996. - [7]
Czeslaw Bylinski.
Functions and their basic properties.
*Journal of Formalized Mathematics*, 1, 1989. - [8]
Czeslaw Bylinski.
Functions from a set to a set.
*Journal of Formalized Mathematics*, 1, 1989. - [9]
Czeslaw Bylinski.
A classical first order language.
*Journal of Formalized Mathematics*, 2, 1990. - [10]
Czeslaw Bylinski.
The modification of a function by a function and the iteration of the composition of a function.
*Journal of Formalized Mathematics*, 2, 1990. - [11]
Yatsuka Nakamura and Andrzej Trybulec.
A mathematical model of CPU.
*Journal of Formalized Mathematics*, 4, 1992. - [12]
Piotr Rudnicki and Andrzej Trybulec.
Memory handling for \SCMFSA.
*Journal of Formalized Mathematics*, 8, 1996. - [13]
Yasushi Tanaka.
On the decomposition of the states of SCM.
*Journal of Formalized Mathematics*, 5, 1993. - [14]
Andrzej Trybulec.
Tarski Grothendieck set theory.
*Journal of Formalized Mathematics*, Axiomatics, 1989. - [15]
Andrzej Trybulec.
Subsets of real numbers.
*Journal of Formalized Mathematics*, Addenda, 2003. - [16]
Andrzej Trybulec and Yatsuka Nakamura.
Some remarks on the simple concrete model of computer.
*Journal of Formalized Mathematics*, 5, 1993. - [17]
Andrzej Trybulec and Yatsuka Nakamura.
Modifying addresses of instructions of \SCMFSA.
*Journal of Formalized Mathematics*, 8, 1996. - [18]
Andrzej Trybulec and Yatsuka Nakamura.
Relocability for \SCMFSA.
*Journal of Formalized Mathematics*, 8, 1996. - [19]
Andrzej Trybulec, Yatsuka Nakamura, and Noriko Asamoto.
On the compositions of macro instructions. Part I.
*Journal of Formalized Mathematics*, 8, 1996. - [20]
Andrzej Trybulec, Yatsuka Nakamura, and Piotr Rudnicki.
The \SCMFSA computer.
*Journal of Formalized Mathematics*, 8, 1996. - [21]
Michal J. Trybulec.
Integers.
*Journal of Formalized Mathematics*, 2, 1990. - [22]
Edmund Woronowicz.
Relations and their basic properties.
*Journal of Formalized Mathematics*, 1, 1989.

[ Download a postscript version, MML identifier index, Mizar home page]