This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bates J., Constable R. — Proofs as programs — ACM Transaction on Programming Languages and Systems, vol. 7, n.1, 1985.
Bertoni A., Mauri G., Miglioli P., Wirsing M. — On different approaches to abstract data types and the existence of recursive models — EATCS bulletin vol. 9, oct. 1979.
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, pp. 127–170.
Bertoni A., Mauri G., Miglioli P., Ornaghi M. — Abstract data types and their extension within a constructive logic — Semantics of data types (Valbonne, 1984), Lecture Notes in Computer Science, vol. 173, Springer-Verlag, Berlin, 1984, pp. 177–195.
Bresciani P., Miglioli P., Moscato U., Ornaghi M. — PAP: Proofs as Programs — (abstract), JSL, Vol. 51, no.3, 1986, pp. 852–853.
Broy M., Wirsing M. — On the algebraic extension of abstract data types — in: Diaz J., Ramos I. (ed.) — Formalization of programming concepts — Lecture Notes in Comp. Sci. vol. 107, Springer-Verlag, Berlin, 1981.
Chang C.C., Keisler H.J. — Model theory — North-Holland, 1973.
Constable R., Knoblock B., Bates J. — Writing programs that construct proofs — Journal of Automated Reasoning vol.1, n.3, 1985. D Reidel Pu. Co., 1981.
Girard J. — Linear logic — report of CNRS, Paris, 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 through Gödel's interpretation — Mathematical studies of information processing, (proceedings, Kyoto, 1978), Lecture Notes in Computer Science, vol.75, Springer-Verlag, Berlin, 1979, pp. 302–325.
Kreisel G. — Some uses of proof-theory in finding computer programs — Notes for a talk in the Logical Symposium of Clermond Ferrand, 1976 (available as a manuscript).
Lloyd J. W. — Foundation of logic programming — Springer Verlag, 1984.
Miglioli P., Moscato U., Ornaghi M. — Constructive theories with abstract data types for program synthesis — It will appear on the Proceedings of the symposium on Mathematical logic and its applications held in Druzhba (Bulgaria) on September 1986.
Martin-Löf P. — Constructive Mathematics and Computer Programming — Logic, Methodology and Philosophy of Science VI, L. Cohen, J. Los H. Pfeiffer, K. Podewski (ed.), North-Holland, Amsterdam, 1982, pp.153–175.
Nordstrom B., Smith J.M. — Propositions, Types and Specifications of Programs in Martin-Löf's Type Theory — BIT, Vol. 24, n.3, 1984, pp.288–301.
Thomason R. — A semantical study of constructible falsity — Zeitschrift fur matematische Logic und Grundlagen der Mathematik, Vol.15, 1969.
Troelstra A.S. — Metamathematical investigation of Intuitionistic Arithmetic and Analysis — Lecture Notes in Mathematics vol. 344, Springer-Verlag, Berlin, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miglioli, P., Moscato, U., Ornaghi, M. (1988). PAP: a logic programming system based on a constructive logic. In: Boscarol, M., Carlucci Aiello, L., Levi, G. (eds) Foundations of Logic and Functional Programming. Lecture Notes in Computer Science, vol 306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19129-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-19129-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19129-2
Online ISBN: 978-3-540-39126-5
eBook Packages: Springer Book Archive