{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:19:05Z","timestamp":1745986745602,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357213"},{"type":"electronic","value":"9783642357220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35722-0_4","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:16:29Z","timestamp":1357298189000},"page":"44-58","source":"Crossref","is-referenced-by-count":0,"title":["Assignment Calculus: A Pure Imperative Language"],"prefix":"10.1007","author":[{"given":"Marc","family":"Bender","sequence":"first","affiliation":[]},{"given":"Jeffery","family":"Zucker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"4_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J.: Can programming be liberated from the von Neumann style?: A functional style and its algebra of programs. Commun. ACM\u00a021(8), 613\u2013641 (1978)","journal-title":"Commun. ACM"},{"key":"4_CR2","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North Holland (1984)"},{"key":"4_CR3","unstructured":"Bender, M.: Assignment Calculus: A Pure Imperative Reasoning Language. PhD thesis, McMaster University (2010)"},{"key":"4_CR4","unstructured":"Carnap, R.: Meaning and Necessity. University of Chicago (1947)"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic\u00a05(2), 56\u201368 (1940)","journal-title":"Journal of Symbolic Logic"},{"key":"4_CR6","unstructured":"Church, A.: The Calculi of Lambda Conversion. Princeton (1941)"},{"key":"4_CR7","unstructured":"Church, A.: A formulation of the logic of sense and denotation. In: Henle, P. (ed.) Structure, Method and Meaning: Essays in Honor of Henry M. Sheffer, pp. 3\u201324. Liberal Arts Press (1951)"},{"key":"4_CR8","unstructured":"Field, A.J., Harrison, P.G.: Functional Programming. Addison-Wesley (July 1988)"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci.\u00a0103(2), 235\u2013271 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR10","first-page":"25","volume":"100","author":"G. Frege","year":"1892","unstructured":"Frege, G.: \u00dcber Sinn und Bedeutung. Zeitschrift f\u00fcr Philosophie und philosophische Kritik\u00a0100, 25\u201350 (1892)","journal-title":"Zeitschrift f\u00fcr Philosophie und philosophische Kritik"},{"key":"4_CR11","first-page":"1","volume-title":"HOPL III: Proc. 3rd ACM SIGPLAN Conf. on History of Prog. Languages","author":"P. Hudak","year":"2007","unstructured":"Hudak, P., Hughes, J., Jones, S.P., Wadler, P.: A history of Haskell: being lazy with class. In: HOPL III: Proc. 3rd ACM SIGPLAN Conf. on History of Prog. Languages, pp. 12-1\u201312-55. ACM, New York (2007)"},{"key":"4_CR12","unstructured":"Hung, H.-K.: Compositional Semantics and Program Correctness for Procedures with Parameters. PhD thesis, SUNY-Buffalo (1990)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Hung, H.-K., Zucker, J.: Semantics of pointers, referencing and dereferencing with intensional logic. In: Proc. 6th Annual IEEE Symposium on Logic in Computer Science, pp. 127\u2013136 (1991)","DOI":"10.1109\/LICS.1991.151637"},{"key":"4_CR14","unstructured":"Janssen, T.M.V.: Foundations and Applications of Montague Grammar: Part 1: Philosophy, Framework, Computer Science. Centrum voor Wiskunde en Informatica, Amsterdam (1986)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-08342-1_22","volume-title":"Automata, Languages and Programming","author":"T.M.V. Janssen","year":"1977","unstructured":"Janssen, T.M.V., van Emde Boas, P.: On the Proper Treatment or Referencing, Dereferencing and Assignment. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol.\u00a052, pp. 282\u2013300. Springer, Heidelberg (1977)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2964568","volume":"24","author":"S.A. Kripke","year":"1959","unstructured":"Kripke, S.A.: A completeness theorem in modal logic. Journal of Symbolic Logic\u00a024, 1\u201314 (1959)","journal-title":"Journal of Symbolic Logic"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1111\/j.1755-2567.1970.tb00434.x","volume":"36","author":"R. Montague","year":"1970","unstructured":"Montague, R.: Universal grammar. Theoria\u00a036, 373\u2013398 (1970)","journal-title":"Theoria"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Montague, R.: The proper treatment of quantification in ordinary English. In: Hintikka, K.J.J., Moravcsik, J.M.E., Suppes, P. (eds.) Approaches to Natural Language, pp. 221\u2013242. Reidel (1973)","DOI":"10.1007\/978-94-010-2506-5_10"},{"key":"4_CR19","volume-title":"Word and Object","author":"W.V. Quine","year":"1960","unstructured":"Quine, W.V.: Word and Object. MIT Press, Cambridge (1960)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS, pp. 55\u201374. IEEE Computer Society (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"4_CR21","unstructured":"Scott, D.S.: Outline of a mathematical theory of computation. Tech. Monograph PRG\u20132, Oxford University Computing Laboratory (1970)"},{"key":"4_CR22","unstructured":"Scott, D., Strachey, C.: Toward a mathematical semantics for computer languages. In: Fox, J. (ed.) Proc. Symp. on Computers and Automata, Brooklyn, N.Y., vol.\u00a0XXI, pp. 19\u201346. Polytechnic Press (April 1971)"},{"issue":"42","key":"4_CR23","first-page":"230","volume":"2","author":"A. Turing","year":"1936","unstructured":"Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc.\u00a02(42), 230\u2013265 (1936)","journal-title":"Proc. London Math. Soc."},{"key":"4_CR24","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The formal semantics of programming languages: an introduction","author":"G. Winskel","year":"1993","unstructured":"Winskel, G.: The formal semantics of programming languages: an introduction. MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35722-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:39Z","timestamp":1745942439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35722-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357213","9783642357220"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35722-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}