{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:42:10Z","timestamp":1725583330451},"publisher-location":"New York, NY","reference-count":9,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387960227"},{"type":"electronic","value":"9780387347684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/978-0-387-34768-4_27","type":"book-chapter","created":{"date-parts":[[2011,5,9]],"date-time":"2011-05-09T04:01:06Z","timestamp":1304913666000},"page":"460-475","source":"Crossref","is-referenced-by-count":0,"title":["The Mechanization of Existence Proofs of Recursive Predicates"],"prefix":"10.1007","author":[{"given":"Ketan","family":"Mulmuley","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Cohn, Avra: The Equivalence of Two Semantic Definitions: A Case Study In LCF; Internal Report, University Of Edinburgh Report, (1981)."},{"key":"27_CR2","unstructured":"Gordon, Michael: Towards a Semantic Theory of Dynamic Binding; Memo AIM-265, Computer Science Department, Stanford University."},{"key":"27_CR3","volume-title":"A Theory of Programming Language Semantics","author":"R. Milne","year":"1976","unstructured":"Milne, Robert and Strachey, Christopher: A Theory of Programming Language Semantics; Chapman and Hall, London, and John Wiley, New York (1976)."},{"key":"27_CR4","unstructured":"Mosses, Peter: Mathematical Semantics and Compiler Generation; Ph.D thesis, Oxford University Computing Laboratory, Programming Research Group (1975)."},{"key":"27_CR5","first-page":"141","volume-title":"On the Relation Between Direct and Continuation Semantics","author":"J.C. Reynolds","year":"1974","unstructured":"Reynolds, J.C.: On the Relation Between Direct and Continuation Semantics; pp. 141\u2013156 of proceedings of the Second Colloquium on Automata, Languages and Programming, Saarbr\u00fccken, Springer-verlag, Berlin (1974)."},{"key":"27_CR6","unstructured":"Scott, Dana: Lectures On a Mathematical Theory of Computation; Technical Monograph PRG-19 (May 1981). Oxford University Computing Laboratory, Programming Research Group."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Sethi, Ravi and Tang Adrian: Constructing Call-by-value Continuation Semantics; Journal of the Association for Computing Machinery,vol 27. No.3. July 1980.pp.580\u2013597.","DOI":"10.1145\/322203.322216"},{"key":"27_CR8","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"J. Stoy","year":"1977","unstructured":"Stoy, Joseph: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory; (MIT Press, Cambridge, MA, 1977)."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0304-3975(81)90037-2","volume":"13","author":"J. Stoy","year":"1981","unstructured":"Stoy, Joseph: The Congruence of Two Programming Language Definitions; Theoretical Computer Science 13 (1981) 151\u2013174. North-Holland Publishing company.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","7th International Conference on Automated Deduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34768-4_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:45:22Z","timestamp":1605649522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34768-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9780387960227","9780387347684"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34768-4_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1984]]}}}