Abstract
Constructive mathematics has been proposed by many authors as a theoretical basis for program synthesis, and various implementations of this idea have been developed. However, the main problem in implementation is how to build a real environment for software development. In this paper, we present the main features of a logical system we are studying which provides specification tools and a deductive system for deriving programs from their specifications. Our aim is to use this system as a starting point for a real programming environment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bates J., Constable R., Proofs as programs, ACM Transaction on Programming Languages and Systems (1), 1985, 113–136.
Bertoni A., Mauri G., Miglioli P., On the power of model theory to specify abstract data types and to capture their recursiveness, Fundamenta Informaticae IV.2, 1983, 127–170.
Bertoni A., Mauri G., Miglioli P., Ornaghi M., Abstract data types and their extension within a constructive logic, in Kahn G., MacQueen D.B., Plotkin G. (eds), Semantics of data types (Sophia-Antipolis, 1984), Lecture Notes in Computer Science 173, Springer-Verlag,Berlin, 1984, 177–195
Bresciani P., Miglioli P., Moscato U., Ornaghi M., PAP: Proofs as Programs-(abstract), Journal of Symbolic Logic 51(3), 1986, 852–853.
Bundy A., Smaill A., Wiggins G., The synthesis of logic programs from inductive proofs, in Lloyd J. (ed), Computational logic Springer-Verlag, 1990, 135-149.
Constable R., Allen S., Bromley H. et al., Implementing Mathematics with the Nuprl Development System, Prentice-Hall, 1986.
Goad C., Computational uses of the manipulation of formal proofs, Rep. STAN-CS-80-819, Stanford University, 1980.
Goguen J.A., Thatcher J.W., Wagner E.G., An initial algebra approach to the specification, correctness and implementation of abstract data types, IBM Res. Rep. RC6487, Yorktown Heights, 1976.
Goto S., Program synthesis from natural deduction proofs, International Joint Conference on Artificial Intelligence, Tokyo, 1979, 339-341.
Henson M., Realizability models for program construction, in J. van de Snepscheut, Mathematics of program construction, Lecture Notes in Computer Science 375, Springer-Verlag,Berlin, 1989
Hiyashi S., Nakano H., PX: A computational logic, MIT Press, Cambridge, 1988.
Kleene S., Introduction to metamathematics, North Holland, Amsterdam, 1952.
Lloyd J., Foundations of logic programming, Springer-Verlag, 1987.
Martin-Löof P., Constructive Mathematics and Computer Programming, in L. Cohen, J. Los, H. Pfeiffer, K. Podewski (eds), VI International Congress for Logic, Methodology and Philosophy of Science, North-Holland, Amsterdam, 1982, 153–179.
Medvedev T., Finite problems, Sov. Math. Dok 3, 1962.
Miglioli P., Moscato U., Ornaghi M., Constructive theories with abstract data types for program synthesis, in Skordev D.G. (ed), Mathematical Logic and its Applications, Plenum Press, New York, 1988, 293–302.
Miglioli P., Moscato U., Ornaghi M., Semi-constructive formal systems and axiomatization of abstract data types, in Diaz J., Orejas F. (eds), TAPSOFT’ 89, Lecture Notes in Computer Science 351, Springer-Verlag, Berlin, 1989, 337–351.
Miglioli P., Ornaghi M., A logically justified model of computation I,II, Fundamenta Informaticae IV. 1, 2, 1981.
Sato M., Towards a mathematical theory of program synthesis, International Joint Conference on Artificial Intelligence, Tokyo, 1979, 757-762.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Miglioli, P., Moscato, U., Ornaghi, M. (1992). Program Specification and Synthesis in Constructive Formal Systems. In: Clement, T.P., Lau, KK. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3494-7_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3494-7_2
Publisher Name: Springer, London
Print ISBN: 978-3-540-19742-3
Online ISBN: 978-1-4471-3494-7
eBook Packages: Springer Book Archive