{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:41Z","timestamp":1759637681092},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543961"},{"type":"electronic","value":"9783540475996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_10","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:43:28Z","timestamp":1330209808000},"page":"192-214","source":"Crossref","is-referenced-by-count":14,"title":["Assignments for applicative languages"],"prefix":"10.1007","author":[{"given":"Vipin","family":"Swarup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uday S.","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evan","family":"Ireland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"M. Felleisen. lambda-v-cs: An extended lambda-calculus for scheme. In ACM Symp. on LISP and Functional Programming, 1988.","DOI":"10.1145\/62678.62686"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"M. Felleisen and D. P. Friedman. A calculus for assignments in higher-order languages. In ACM Symp. on Principles of Programming Languages, pages 314\u2013325, 1987.","DOI":"10.1145\/41625.41654"},{"key":"10_CR3","unstructured":"M. Felleisen and R. Hieb. The revised report on the syntactic theories of sequential control and state. Technical Report COMP TR89-100, Rice University, 1989."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"J.C. Guzman and P. Hudak. Single-threaded polymorphic lambda calculus. In IEEE Symp. on Logic in Computer Science, pages 333\u2013343, 1990.","DOI":"10.1109\/LICS.1990.113759"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"D.K. Gifford and J.M. Lucassen. Integrating functional and imperative programming. In ACM Symp. on LISP and Functional Programming, pages 28\u201338, 1986.","DOI":"10.1145\/319838.319848"},{"key":"10_CR6","unstructured":"Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge University Press, 1989."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"P. Hudak and A. Bloss. The aggregate update problem in functional programming systems. In ACM Symp. on Principles of Programming Languages, pages 300\u2013314, 1985.","DOI":"10.1145\/318593.318660"},{"issue":"8","key":"10_CR8","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/27651.27653","volume":"30","author":"C. A. R. Hoare","year":"1987","unstructured":"C. A. R. Hoare, I. J. Hayes, He Jifeng, C. C. Morgan, A. W. Roscoe, J. W. Sanders, I. H. Sorensen, J. M. Spivey, and B. A. Sufrin. Laws of programming. Communications of the ACM, 30(8):672\u2013686, August 1987.","journal-title":"Communications of the ACM"},{"key":"10_CR9","unstructured":"P. Hudak and R. Sundaresh. On the expressiveness of purely functional I\/O systems. Technical Report YALEU\/DCS\/RR665, Yale University, Dec 1988."},{"issue":"4","key":"10_CR10","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797\u2013821, October 1980. (Previous version in Proc. Symp. Foundations of Computer Science, Oct 1977).","journal-title":"Journal of the ACM"},{"key":"10_CR11","unstructured":"J. Hughes. Why functional programming matters. In Research Topics in Functional Programming, Univ. of Texas at Austin Year of Programming Series, chapter 2, pages 17\u201342. Addison-Wesley, 1990."},{"key":"10_CR12","unstructured":"P. Hudak and P. Wadler (editors). Report on the programming language Haskell, A non-strict purely functional language (Version 1.0). Technical Report YALEU\/DCS\/RR-777, Dep. of Computer Sc., Yale University, Apr 1990."},{"key":"10_CR13","unstructured":"K. Karlsson. Nebula, A functional operating system. Tech. report, Chalmers University, 1981."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"J.M. Lucassen and D.K. Gifford. Polymorphic effect systems. In ACM Symp. on Principles of Programming Languages, pages 47\u201357, 1988.","DOI":"10.1145\/73560.73564"},{"key":"10_CR15","unstructured":"L. M. McLoughlin and S. Hayes. Interlanguage working from a pure functional language. Functional Programming mailing list, Nov 1988."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"J. C. Mitchell. Type systems for programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. North-Holland, Amsterdam, 1990. (also Report No. STAN-CS-89-1277, Department of Computer Science, Stanford University).","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"I. A. Mason and C. Talcott. Axiomatizing operational equivalence in the presence of side effects. In IEEE Symp. on Logic in Computer Science, pages 284\u2013293. IEEE, 1989.","DOI":"10.1109\/LICS.1989.39183"},{"key":"10_CR18","unstructured":"I. A. Mason and C. Talcott. A sound and complete axiomatization of operational equivalence between programs with memory. Technical Report STAN-CS-89-1250, Stanford University, 1989. (to appear in Theoretical Computer Science)."},{"key":"10_CR19","volume-title":"The definition of Standard ML","author":"R. Milner","year":"1990","unstructured":"R. Milner, M. Tofte, and R. Harper. The definition of Standard ML. The MIT Press, Cambridge, Massachusetts, 1990."},{"key":"10_CR20","unstructured":"N. Perry. The Implementation of Practical Functional Programming Languages. PhD thesis, Imperial College of Science, Technology and Medicine, University of London, 1990."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"D. Prawitz. Ideas and results in proof theory. In Proc. Second Scandinavian Logic Symposium, 1971.","DOI":"10.1016\/S0049-237X(08)70849-8"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"J. Rees and W. Clinger (editors). Revised3 report on the algorithmic language scheme. ACM SIGPLAN Notices, 21(12):37\u201379, Dec 1986.","DOI":"10.1145\/15042.15043"},{"key":"10_CR23","unstructured":"J. C. Reynolds. The essence of Algol. In J. W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages, pages 345\u2013372. North-Holland, 1981."},{"key":"10_CR24","unstructured":"J. C. Reynolds. Idealized Algol and its specification logic. In Neel. D., editor, Tools and Notions for Program Construction, pages 121\u2013161. Cambridge Univ. Press, 1982."},{"key":"10_CR25","unstructured":"J.C. Reynolds. Preliminary design of the programming language Forsythe. Technical Report CMU-CS-88-159, Carnegie Mellon University, June 1988."},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23\u201341, 1965.","journal-title":"Journal of the ACM"},{"issue":"2","key":"10_CR27","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/3318.3323","volume":"7","author":"D. A. Schmidt","year":"1985","unstructured":"D. A. Schmidt. Detecting global variables in denotational specifications. ACM Transactions on Programming Languages and Systems, 7(2):299\u2013310, Apr 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"V. Swarup and U.S. Reddy. A logical view of assignments. In Conf. on Constructivity in Computer Science, 1991. (To appear).","DOI":"10.1007\/BFb0021087"},{"key":"10_CR29","unstructured":"J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977."},{"key":"10_CR30","unstructured":"C. Strachey and C. P. Wadsworth. Continuations \u2014 a mathematical semantics for handling full jumps. Tech. Monograph PRG-11, Programming Research Group, University of Oxford, 1974."},{"key":"10_CR31","unstructured":"V. Swarup. Type theoretic properties of assignments. PhD thesis, University of Illinois at Urbana-Champaign, 1991. (To appear)."},{"key":"10_CR32","first-page":"240","volume-title":"Proceedings of Logic Colloquium, volume 453 of Lecture Notes in Mathematics","author":"W. W. Tait","year":"1975","unstructured":"W. W. Tait. A realizability interpretation of the theory of species. In R. Parikh, itor, Proceedings of Logic Colloquium, volume 453 of Lecture Notes in Mathematics, pages 240\u2013251. Springer, Berlin, 1975."},{"key":"10_CR33","unstructured":"M. Tofte. Operational semantics and polymorphic type inference. PhD thesis, Edinburgh University, 1988. Available as Edinburgh Univ. Lab. for Foundations of Computer Science Technical Report ECS-LFCS-88-54."},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"P. Wadler. Comprehending monads. In ACM Symp. on LISP and Functional Programming, 1990.","DOI":"10.1145\/91556.91592"},{"key":"10_CR35","volume-title":"IFIP Working Conf. on Programming Concepts and Methods","author":"P. Wadler","year":"1990","unstructured":"P. Wadler. Linear types can change the world. In IFIP Working Conf. on Programming Concepts and Methods, Sea of Gallilee, Israel, Apr 1990."},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"P. Wadler. Is there a use for linear logic? In Proc. ACM SIGPLAN Conf. on Partial Evaluation and Semantics-Based Program Manipulation, New York, 1991. ACM. (SIGPLAN Notices, to appear).","DOI":"10.1145\/115865.115894"}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540543961_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:17Z","timestamp":1619572877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3540543961_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}