{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:22:21Z","timestamp":1725895341388},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540111894"},{"type":"electronic","value":"9783642683534"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/978-3-642-68353-4_48","type":"book-chapter","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T06:25:56Z","timestamp":1320215156000},"page":"311-322","source":"Crossref","is-referenced-by-count":2,"title":["Constructive Proofs as Programs Executable by PrT Nets"],"prefix":"10.1007","author":[{"given":"P.","family":"Miglioli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Moscato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ornaghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","volume-title":"Comp. Sc. n. 84, Springer","author":"W Brauer","year":"1980","unstructured":"W. Brauer (ed.) - Net theory and applications. Lect. No. in Comp. Sc. n. 84, Springer 1980"},{"key":"48_CR2","volume-title":"Constable - Constructive mathematics and automatic program writers","author":"R.L","year":"1971","unstructured":"R.L. Constable - Constructive mathematics and automatic program writers. IFIP Congress, North Holland 1971."},{"key":"48_CR3","unstructured":"C.A. Goad - Computational uses of the manipulation of formal proofs. Rep. STAN-CS-8O-819, Stanford University 1980,"},{"key":"48_CR4","unstructured":"S. Goto - Program synthesis trough GBdel\u2019s interpretation. In E.K. Blum, S. Takasu (ed.), Proc. Int. Conf. on Math. Studies of Information processing, Kyoto University 198O."},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Z. Manna, R. Waldinger - Towards automatic program synthesis. Symp. on semantics of algorithmic languages, Lect. No. in Math., Springer 1971.","DOI":"10.1007\/BFb0059702"},{"key":"48_CR6","unstructured":"J P. Martin L\u00f6f - Constructive mathematics and computer programming. Presented at the 6-th Congress for Logic, Methodology and Philosophy of Science, Hannover 1979"},{"key":"48_CR7","volume-title":"To appear in Fundamenta Informaticae","author":"P Miglioli","year":"1981","unstructured":"P- Miglioli, M. Ornaghi - A logically justified computing model. To appear in Fundamenta Informaticae 1981."},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"A.S. Troelstra - Aspects of constructive mathematics. In J. Barwise (ed.), Handbook of mathematical logic, North-Holland 1977.","DOI":"10.1016\/S0049-237X(08)71127-3"}],"container-title":["Informatik-Fachberichte","Application and Theory of Petri Nets"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-68353-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T04:55:03Z","timestamp":1557896103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-68353-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540111894","9783642683534"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-68353-4_48","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1982]]}}}