{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:56Z","timestamp":1725662936698},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133469"},{"type":"electronic","value":"9783540388913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13346-1_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:05:19Z","timestamp":1330193119000},"page":"177-195","source":"Crossref","is-referenced-by-count":5,"title":["Abstract data types and their extensions within a constructive logic"],"prefix":"10.1007","author":[{"given":"A.","family":"Bertoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Mauri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Miclioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ornaghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"9_CR1","unstructured":"Bergstra, J.A., Tucker, J.V., INITIAL ALGEBRA SEMANTICS FOR DATA TYPE SPECIFICATIONS: TWO CHARACTERIZATION THEOREMS, Department of Computer Science, University of Leiden, 1980."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/3-540-09510-1_3"},{"key":"9_CR3","unstructured":"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"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-09981-6_4"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.3233\/FI-1983-6202"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-09510-1_7"},{"key":"9_CR7","unstructured":"Chang, C.C., Keisler, H.J., MODEL THEORY, North Holland, 1973"},{"key":"9_CR8","unstructured":"Constable, R., CONSTRUCTIVE MATHEMATICS AND AUTOMATIC PROGRAM WRITERS, Proc. of the IFIP Congress 1971 (Lublijana), TA-2, North-Holland, 1971"},{"key":"9_CR9","unstructured":"Degli Antoni, G., Miglioli, P., Ornaghi, M., THE SYNTHESIS OF PROGRAMS IN AN INTUITIONISTIC FRAME, Report of Istituto di Cibernetica dell'Universit\u00e0 di Milano, 1974"},{"key":"9_CR10","unstructured":"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"},{"key":"9_CR11","unstructured":"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."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Keisler, H.J., FUNDAMENTALS OF MODEL THEORY, in \u2018Handbook of Mathematical Logic\u2019 (Barwise ed.) North Holland, 1977","DOI":"10.1016\/S0049-237X(08)71098-X"},{"key":"9_CR13","unstructured":"Kleene, S.C., INTRODUCTION TO METAMATHEMATICS, North Holland, 1951"},{"key":"9_CR14","unstructured":"Kreisel, G., SOME USES OF PROOF THEORY FOR FINDING COMPUTER PROGRAMS, Notes for a talk in the logical Symposium of Clermond Ferrand, 1975 (manuscript)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Kripke, S., SEMANTICAL ANALYSIS OF INTUITIONISTIC LOGIC I, in Formal Systems and Recursive Functions, North Holland, 1965.","DOI":"10.1016\/S0049-237X(08)71685-9"},{"key":"9_CR16","series-title":"Res. Rep.","volume-title":"A Purely logical computing model: the open proofs as programs","author":"P. Miglioli","year":"1979","unstructured":"Miglioli, P., Ornaghi, M., A PURELY LOGICAL COMPUTING MODEL: THE OPEN PROOFS AS PROGRAMS, Res. Rep. MIG-7, Istituto di Cibernetica, Milano, 1979."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Miglioli, P., Ornaghi, M., A LOGICALLY JUSTIFIED MODEL OF COMPUTATION, Fundamenta Informaticae IV.1, IV.2, 1981","DOI":"10.3233\/FI-1981-4205"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Miglioli, P., Moscato, U., Ornaghi M., CONSTRUCTIVE PROOFS EXECUTABLE BY PrT NETS, Informatik-Fachberichte 52, Springer Verlag, 1982","DOI":"10.1007\/978-3-642-68353-4_48"},{"key":"9_CR19","unstructured":"Prawitz, D., NATURAL DEDUCTION: A PROOF THEORETICAL STUDY, Stockholm, Goteborg, Uppsala (Almqvist and Wiksell), 1965"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Prawitz, D., IDEAS AND RESULTS IN PROOF THEORY, Oslo Proceedings, 1971","DOI":"10.1016\/S0049-237X(08)70849-8"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/800133.804340"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Troelstra, A.S. (ed.), MATHEMATICAL INVESTIGATION OF INTUITIONSITIC ARITHMETIC AND ANALYSIS, Lect. Notes in Mathematics 344, Springer Verlag, 1973","DOI":"10.1007\/BFb0066739"},{"key":"9_CR23","unstructured":"Wand, M., FINAL ALGEBRA SEMANTICS AND DATA TYPE EXTENSIONS, Indiana Univ., Comp. Science Dept., Tech. Rep. n. 65, 1977"}],"container-title":["Lecture Notes in Computer Science","Semantics of Data Types"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13346-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:29:26Z","timestamp":1640914166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13346-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133469","9783540388913"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-13346-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}