{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171441},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540513711"},{"type":"electronic","value":"9783540462019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035784","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:00:28Z","timestamp":1133427628000},"page":"574-588","source":"Crossref","is-referenced-by-count":13,"title":["Programming, transforming, and proving with function abstractions and memories"],"prefix":"10.1007","author":[{"given":"Ian","family":"Mason","sequence":"first","affiliation":[]},{"given":"Carolyn","family":"Talcott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"37_CR1","unstructured":"Felleisen, M. [1987] The calculi of lambda-v-cs conversion: A syntactic theory of control and state in imperative higher-order programming languages, Ph.D. thesis, Indiana University."},{"key":"37_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. J. Landin","year":"1964","unstructured":"Landin, P. J. [1964] The mechanical evaluation of expressions, Computer Journal, 6, pp. 308\u2013320.","journal-title":"Computer Journal"},{"key":"37_CR3","unstructured":"Mason, I. A. [1986] The semantics of destructive Lisp, Ph.D. Thesis, Stanford University."},{"key":"37_CR4","unstructured":"Mason, I. A. and Talcott, C. L. [1989a] Equivalence of programs with function abstractions and memories, Submitted to Lisp and Symbolic Computation."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Mason, I. A. and Talcott, C. L. [1989b] Axiomatizing Operational Equivalence in the presence of Side Effects, in: Symposium on logic in computer science, (IEEE), (to appear).","DOI":"10.1109\/LICS.1989.39183"},{"key":"37_CR6","unstructured":"Mason, I. A. and Talcott, C. L. [1989c] A sound and complete axiomatization of operational equivalence between programs with memory, Department of Computer Science, Stanford University, Technical report STAN-CS-89-1250."},{"key":"37_CR7","unstructured":"Mason, I. A. and Talcott, C. L. [1989d] Programming, transforming and proving with function abstractions and memories, Department of Computer Science, Stanford University, Technical report STAN-CS-89-????."},{"key":"37_CR8","unstructured":"Morris, J. H. [1968] Lambda calculus models of programming languages, Ph.D. thesis, MIT."},{"key":"37_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-13346-1_4","volume-title":"Semantics of data types, international symposium, Sophia-Antipolis, June 1984, proceedings","author":"P. Mosses","year":"1984","unstructured":"Mosses, P. [1984] A basic abstract semantic algebra, in: Semantics of data types, international symposium, Sophia-Antipolis, June 1984, proceedings, edited by G. Kahn, D.B. MacQueen, and G. Plotkin, Lecture notes in computer science, no. 173 (Springer, Berlin) pp. 87\u2013108."},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. Plotkin","year":"1975","unstructured":"Plotkin, G. [1975] Call-by-name, call-by-value and the lambda-v-calculus, Theoretical Computer Science, 1, pp. 125\u2013159.","journal-title":"Theoretical Computer Science"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Reynolds, J. C. [1972] Definitional interpreters for higher-order programming languages, in: Proceedings, ACM national convention, pp. 717\u2013740.","DOI":"10.1145\/800194.805852"},{"key":"37_CR12","unstructured":"Talcott, C. [1985] The essence of Rum: A theory of the intensional and extensional aspects of Lisp-type computation, Ph.D. Thesis, Stanford University."},{"key":"37_CR13","unstructured":"Talcott, C. [1987] Programming and proving with function and control abstractions, (Course notes)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T05:09:45Z","timestamp":1549429785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0035784","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}