A bridge between constructive logic and computer programming. (English) Zbl 0737.68009
The paper is a good introduction into applied constructive logics and presents, in an informally manner, some logic notions and their analogies among programming concepts. Also, there are shown some non-usually complex examples. All of these are very useful in synthesis and analysis of computer programs and programming languages.
Reviewer: P.-G.Holban (Iaşi)
MSC:
| 68N01 | General topics in the theory of software |
| 03B80 | Other applications of logic |
| 03B20 | Subsystems of classical logic (including intuitionistic logic) |
Software:
NuprlReferences:
| [1] | Bishop, E., Foundations of Constructive Analysis, 284 (1967), New York · Zbl 0183.01503 |
| [2] | Constable, R. L., Constructive mathematics and automatic program writers, Information Processing 71, vol. 1, 229-233 (1972), Amsterdam · Zbl 0255.68014 |
| [3] | Constable, R. L., Implementing Mathematics with the Nurpl Proof Development System (1986), Prentice Hall: Prentice Hall Englewood Cliffs, NJ |
| [4] | Curry, H. B., The logic of program composition, Collect Logique Math., Paris, A5, 97-102 (1954) · Zbl 0057.34803 |
| [5] | Girard, J.-Y., Linear logic, Theoret. Comput. Sci., 50, 1-102 (1987) · Zbl 0625.03037 |
| [6] | Hayashi, S.; Nakano, H., PX: A Computational Logic, 200 (1988), Cambridge, MA |
| [7] | Kleene, S. C., On the interpretation of intuitionistic number theory, J. Symbolic Logic, 10, 109-124 (1945) · Zbl 0063.03260 |
| [8] | Knuth, D. E., (Algorithms in Modern Mathematics and Computer Science, 122 (1981), Springer: Springer Berlin), 82-99, Lecture Notes in Computer Science · Zbl 0477.68035 |
| [9] | Kowalsky, R., Algorithm = logic+control, Comm. ACM, 22, 7, 424-436 (1979) · Zbl 0404.68010 |
| [10] | Kreisel, G., Some uses of proof theory to improve computer programs, (Logic Colloquium (1975), Clermond-Ferrand) |
| [11] | Martin-Löf, P., Constructive mathematics and computer programming, (Cohen, L. J.; etal., Logic, Methodology and Philosophy of Science, VI (1982), North-Holland: North-Holland Amsterdam), 153-179 · Zbl 0552.03040 |
| [12] | Nepejvoda, N. N., A relation between the natural deduction rules and operators of higher level algorithmic languages, Soviet Math. Dokl., 19, 2, 360-363 (1978) · Zbl 0392.68004 |
| [13] | Nepejvoda, N. N., On correct program construction, Voprosy Kibernet, 46 (1978), (Moscow) · Zbl 0977.68010 |
| [14] | Nepejvoda, N. N., Proofs as graphs, Semiotikai Informatika (Semiotics and Informatics), 25, 52-82 (1985), (in Russian) · Zbl 0621.03037 |
| [15] | Nepejvoda, N. N., The good surprise rule and structured gotos, Semiotika i informatika (Semiotics and Informatics), 23 (1984), (in Russian) · Zbl 0562.03030 |
| [16] | Tseytin, G. S., Some features of a language for a proof-checking programming system, (Lecture Notes in Computer Science, 5 (1974), Springer: Springer Berlin), 394-407 · Zbl 0282.68005 |
| [17] | E. Tyugu and G. Minc, Justification of the structural synthesis of programs.; E. Tyugu and G. Minc, Justification of the structural synthesis of programs. · Zbl 0514.68019 |
| [18] | Venn, J., Symbolic Logic (1894), London · Zbl 0122.13106 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
