Skip to main content
SpringerLink
Log in

Abstract data types and their extensions within a constructive logic

  • Conference paper
  • First Online:
Semantics of Data Types (SDT 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 173))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bergstra, J.A., Tucker, J.V., INITIAL ALGEBRA SEMANTICS FOR DATA TYPE SPECIFICATIONS: TWO CHARACTERIZATION THEOREMS, Department of Computer Science, University of Leiden, 1980.

    Google Scholar 

  2. Bertoni, A., Mauri, G., Miglioli, P., CHARACTERIZATION OF ABSTRACT DATA TYPES AS MODEL THEORETIC INVARIANTS, Proc. 6th ICALP, Letc. Notes in Comp. Science 71, Springer-Verlag, 1979

    Google Scholar 

  3. Bertoni, A., Mauri, G., Miglioli, P., Wirsing, M., ON DIFFERENT APPROACHES TO ABSTRACT DATA TYPES AND THE EXISTENCE OF RECURSIVE MODELS, Bulletin of EATCS, n. 9, 1979

    Google Scholar 

  4. Bertoni, A., Mauri, G., Miglioli, P., TOWARDS A THEORY OF ABSTRACT DATA TYPES: A DISCUSSION ON PROBLEMS AND TOOLS, Proc. Colloque sur la Programmation '80, Lect. Notes in Comp. Science, Springer Verlag, 1980.

    Google Scholar 

  5. Bertoni, A., Mauri, G., Miglioli, P., SOME USES OF MODEL THEORY TO SPECIFY ABSTRACT DATA TYPES AND TO CAPTURE THEIR RECURSIVENESS, Fundamenta Informaticae, VI.2, 1983

    Google Scholar 

  6. Broy, M., Dosch, W., Partsch, H., Pepper, P., Wirsing, M., EXISTENTIAL QUANTIFIERS IN ABSTRACT DATA TYPES, Proc. 6th ICALP, Lect. Notes in Comp. Science 71, Springer Verlag, 1979.

    Google Scholar 

  7. Chang, C.C., Keisler, H.J., MODEL THEORY, North Holland, 1973

    Google Scholar 

  8. Constable, R., CONSTRUCTIVE MATHEMATICS AND AUTOMATIC PROGRAM WRITERS, Proc. of the IFIP Congress 1971 (Lublijana), TA-2, North-Holland, 1971

    Google Scholar 

  9. Degli Antoni, G., Miglioli, P., Ornaghi, M., THE SYNTHESIS OF PROGRAMS IN AN INTUITIONISTIC FRAME, Report of Istituto di Cibernetica dell'Università di Milano, 1974

    Google Scholar 

  10. Degli Antoni, G., Miglioli, P., Ornaghi, M., THE SYNTHESIS OF PROGRAMS AS AN APPROACH TO THE CONSTRUCTION OF RELIABLE PROGRAMS, Proc. of the International Conference on Proving and Improving Programs, Arc et Senans, 1975

    Google Scholar 

  11. Goguen, J.A., Tatcher, J.W., Wagner, E.G., AN INITIAL ALGEBRA APPROACH TO THE SPECIFICATION, CORRECTNESS AND IMPLEMENTATION OF ABSTRACT DATA TYPES, IBM Res. Rep. RC6 487, Yorktown Heights, 1976.

    Google Scholar 

  12. Keisler, H.J., FUNDAMENTALS OF MODEL THEORY, in ‘Handbook of Mathematical Logic’ (Barwise ed.) North Holland, 1977

    Google Scholar 

  13. Kleene, S.C., INTRODUCTION TO METAMATHEMATICS, North Holland, 1951

    Google Scholar 

  14. Kreisel, G., SOME USES OF PROOF THEORY FOR FINDING COMPUTER PROGRAMS, Notes for a talk in the logical Symposium of Clermond Ferrand, 1975 (manuscript)

    Google Scholar 

  15. Kripke, S., SEMANTICAL ANALYSIS OF INTUITIONISTIC LOGIC I, in Formal Systems and Recursive Functions, North Holland, 1965.

    Google Scholar 

  16. Miglioli, P., Ornaghi, M., A PURELY LOGICAL COMPUTING MODEL: THE OPEN PROOFS AS PROGRAMS, Res. Rep. MIG-7, Istituto di Cibernetica, Milano, 1979.

    Google Scholar 

  17. Miglioli, P., Ornaghi, M., A LOGICALLY JUSTIFIED MODEL OF COMPUTATION, Fundamenta Informaticae IV.1, IV.2, 1981

    Google Scholar 

  18. Miglioli, P., Moscato, U., Ornaghi M., CONSTRUCTIVE PROOFS EXECUTABLE BY PrT NETS, Informatik-Fachberichte 52, Springer Verlag, 1982

    Google Scholar 

  19. Prawitz, D., NATURAL DEDUCTION: A PROOF THEORETICAL STUDY, Stockholm, Goteborg, Uppsala (Almqvist and Wiksell), 1965

    Google Scholar 

  20. Prawitz, D., IDEAS AND RESULTS IN PROOF THEORY, Oslo Proceedings, 1971

    Google Scholar 

  21. Thatcher, J.W., Wagner, E.G., Wright, J.B., DATA TYPE SPECIFICATION: PARAMETRIZATION AND THE POWER OF SPECIFICATION TECHNIQUES, Proc. SIGACT 10th Symp. on theory of computing, 1978

    Google Scholar 

  22. Troelstra, A.S. (ed.), MATHEMATICAL INVESTIGATION OF INTUITIONSITIC ARITHMETIC AND ANALYSIS, Lect. Notes in Mathematics 344, Springer Verlag, 1973

    Google Scholar 

  23. Wand, M., FINAL ALGEBRA SEMANTICS AND DATA TYPE EXTENSIONS, Indiana Univ., Comp. Science Dept., Tech. Rep. n. 65, 1977

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Cibernetica, Universita Di Miland, Via Viotti 5, Milano, Italie

    A. Bertoni, G. Mauri, P. Miclioli & M. Ornaghi

Authors
  1. A. Bertoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Miclioli
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Ornaghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gilles Kahn David B. MacQueen Gordon Plotkin

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertoni, A., Mauri, G., Miclioli, P., Ornaghi, M. (1984). Abstract data types and their extensions within a constructive logic. In: Kahn, G., MacQueen, D.B., Plotkin, G. (eds) Semantics of Data Types. SDT 1984. Lecture Notes in Computer Science, vol 173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13346-1_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-13346-1_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13346-9

  • Online ISBN: 978-3-540-38891-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation