Keywords
- Iteration Variable
- Register Program
- Procedure Variable
- Sequent Calculus
- Nonstandard Analysis
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
4. References
H. ANDRÉKA, I. NÉMETI, and I. SAIN (1980), Nonstandard runs of Floyd-provable programs, Proceedings of the Symposium on Algorithmic Logic, A. Salwicki (editor), Lecture Notes in Computer Science, Springer-Verlag, to appear.
L. CZIRMAZ (1981), Completeness of Floyd-Hoare program verification, Theoretical Computer Science, 2, pp. 199–211.
C. A. R. HOARE (1969), An axiomatic basis for computer programming, Communications of the Association for Computing Machinery, 12, pp. 576–580, 583.
C. A. R. HOARE (1971), Procedures and parameters: An axiomatic approach, Symposium on Semantics of Programming Languages, E. Engeler (editor), Lecture Notes in Mathematics, 188, Springer-Verlag, New York, pp. 102–116.
F. KRÖGER (1976), Logical rules of natural reasoning about programs, Automata, Languages, and Programming, S. Michaelson and R. Milner (editors), Edinburgh University Press, Edinburgh, pp. 87–98.
F. KRÖGER (1977), LAR: A logic for algorithmic reasoning, Acta Informatica, 8, pp. 242–266.
E. NELSON (1977), Internal set theory, Bulletin of the American Mathematical Society, 83, pp. 1165–1198.
M. M. RICHTER (1981), Monaden, ideale Punkte und Nichtstandard-Methoden, Vieweg-Verlag, 1981.
D. SCOTT and C. STRACHEY (1971), Towards a mathematical semantics for computer languages, Technical Monographs PRG-6, Oxford University Computing Laboratory, Programming Research Group.
D. SCOTT (1974), Data types as lattices, Proceedings of the International Summer Institute and Logic Colloquium, Kiel 1974, G. H. Müller, A. Oberschelp, and K. Pothoff (editors), Lecture Notes in Mathematics, 499, pp. 579–651.
M. E. SZABO (1980), A sequent calculus for Kröger logic, Proceedings of the Symposium on Algorithmic Logic, A. Salwicki (editor), Lecture Notes in Computer Science, Springer-Verlag, to appear.
M. E. SZABO (1981), Variable truth, to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Richter, M.M., Szabo, M.E. (1983). Towards a nonstandard analysis of programs. In: Hurd, A.E. (eds) Nonstandard Analysis-Recent Developments. Lecture Notes in Mathematics, vol 983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0065340
Download citation
DOI: https://doi.org/10.1007/BFb0065340
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12279-1
Online ISBN: 978-3-540-39602-4
eBook Packages: Springer Book Archive
