Volume 9, 1997

University of Bialystok

Copyright (c) 1997 Association of Mizar Users

**Noriko Asamoto**- Ochanomizu University, Tokyo

- We implement two macroinstructions {\tt loop} and {\tt Times} which iterate macroinstructions of {\SCMFSA}. In a {\tt loop} macroinstruction it jumps to the head when the original macroinstruction stops, in a {\tt Times} macroinstruction it behaves as if the original macroinstrucion repeats $n$ times.

- Preliminaries
- The {\tt loop} Macroinstruction
- The {\tt Times} Macroinstruction
- An example

- [1]
Noriko Asamoto.
Conditional branch macro instructions of \SCMFSA. Part I.
*Journal of Formalized Mathematics*, 8, 1996. - [2]
Noriko Asamoto.
Conditional branch macro instructions of \SCMFSA. Part II.
*Journal of Formalized Mathematics*, 8, 1996. - [3]
Noriko Asamoto.
Constant assignment macro instructions of \SCMFSA. Part II.
*Journal of Formalized Mathematics*, 8, 1996. - [4]
Noriko Asamoto, Yatsuka Nakamura, Piotr Rudnicki, and Andrzej Trybulec.
On the composition of macro instructions. Part II.
*Journal of Formalized Mathematics*, 8, 1996. - [5]
Noriko Asamoto, Yatsuka Nakamura, Piotr Rudnicki, and Andrzej Trybulec.
On the composition of macro instructions. Part III.
*Journal of Formalized Mathematics*, 8, 1996. - [6]
Grzegorz Bancerek.
Cardinal numbers.
*Journal of Formalized Mathematics*, 1, 1989. - [7]
Grzegorz Bancerek.
The fundamental properties of natural numbers.
*Journal of Formalized Mathematics*, 1, 1989. - [8]
Grzegorz Bancerek and Piotr Rudnicki.
Development of terminology for \bf scm.
*Journal of Formalized Mathematics*, 5, 1993. - [9]
Grzegorz Bancerek and Andrzej Trybulec.
Miscellaneous facts about functions.
*Journal of Formalized Mathematics*, 8, 1996. - [10]
Czeslaw Bylinski.
Functions and their basic properties.
*Journal of Formalized Mathematics*, 1, 1989. - [11]
Czeslaw Bylinski.
A classical first order language.
*Journal of Formalized Mathematics*, 2, 1990. - [12]
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. - [13]
Yatsuka Nakamura and Andrzej Trybulec.
A mathematical model of CPU.
*Journal of Formalized Mathematics*, 4, 1992. - [14]
Takaya Nishiyama and Yasuho Mizuhara.
Binary arithmetics.
*Journal of Formalized Mathematics*, 5, 1993. - [15]
Piotr Rudnicki and Andrzej Trybulec.
Memory handling for \SCMFSA.
*Journal of Formalized Mathematics*, 8, 1996. - [16]
Yasushi Tanaka.
On the decomposition of the states of SCM.
*Journal of Formalized Mathematics*, 5, 1993. - [17]
Andrzej Trybulec.
Enumerated sets.
*Journal of Formalized Mathematics*, 1, 1989. - [18]
Andrzej Trybulec.
Tarski Grothendieck set theory.
*Journal of Formalized Mathematics*, Axiomatics, 1989. - [19]
Andrzej Trybulec and Yatsuka Nakamura.
Some remarks on the simple concrete model of computer.
*Journal of Formalized Mathematics*, 5, 1993. - [20]
Andrzej Trybulec and Yatsuka Nakamura.
Modifying addresses of instructions of \SCMFSA.
*Journal of Formalized Mathematics*, 8, 1996. - [21]
Andrzej Trybulec and Yatsuka Nakamura.
Relocability for \SCMFSA.
*Journal of Formalized Mathematics*, 8, 1996. - [22]
Andrzej Trybulec, Yatsuka Nakamura, and Noriko Asamoto.
On the compositions of macro instructions. Part I.
*Journal of Formalized Mathematics*, 8, 1996. - [23]
Andrzej Trybulec, Yatsuka Nakamura, and Piotr Rudnicki.
The \SCMFSA computer.
*Journal of Formalized Mathematics*, 8, 1996. - [24]
Edmund Woronowicz.
Relations and their basic properties.
*Journal of Formalized Mathematics*, 1, 1989.

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