{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:15:02Z","timestamp":1760044502284},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552536"},{"type":"electronic","value":"9783540468035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55253-7_23","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:56:57Z","timestamp":1330250217000},"page":"390-407","source":"Crossref","is-referenced-by-count":12,"title":["Observers for linear types"],"prefix":"10.1007","author":[{"given":"Martin","family":"Odersky","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"23_CR1","volume-title":"Computational interpretations of linear logic","author":"S. Abramsky","year":"1990","unstructured":"S. Abramsky. Computational interpretations of linear logic. Preprint, Imperial College, London, 1990."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"H.G. Baker. Unify and conquer (garbage, updating, aliasing, ...) in functional languages. In Proc. ACM Conf. on LISP and Functional Programming, pages 218\u2013226, June 1990.","DOI":"10.1145\/91556.91652"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"A. Bloss. Update analysis and the efficient implementation of functional aggregates. In Proc. ACM Conf. on Functional Programming Languages and Computer Architecture, August 1989.","DOI":"10.1145\/99370.99373"},{"key":"23_CR4","unstructured":"D. Clement, J. Despeyroux, T. Despeyroux, L. Hascoet, and G. Kahn. Natural semantics on the computer. Technical Report RR 416, INRIA, June 1985."},{"key":"23_CR5","unstructured":"S. Cohen. Multi-version structures in prolog. In Proc. Conf. on Fifth Generation Computer Systems, pages 265\u2013274, 1984."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In Proc. 17th ACM Symposium on Principles of Programming Languages, Jan. 1990.","DOI":"10.1145\/96709.96725"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"M. Draghicescu and S. Puroshothaman. A compositional analysis of evaluation order and its application. In Proc. ACM Conf. on Lisp and Functional Programming, June 1990.","DOI":"10.1145\/91556.91658"},{"key":"23_CR8","unstructured":"J.C. Guzm\u00e1n and P. Hudak. Single-threaded polymorphic lambda calculus. In Proc. 5th IEEE Symp. on Logic in Computer Science, June 1990."},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"K. Gharachorloo, V. Sarkar, and J.L. Hennessy. A simple and efficient approach for single assignment languages. In Proc. ACM Conf. on Lisp and Functional Programming, 1988.","DOI":"10.1145\/62678.62718"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"P. Hudak. A semantic model of reference counting and its abstraction. In S. Abramsky and C. Hankin, editors, Abstract interpretation of declarative languages. Ellis Horwood Ltd., 1987.","DOI":"10.1145\/319838.319876"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"P. Jouvelot and D.K. Gifford. Algebraic reconstruction of types and effects. In Proc. 18th ACM Symp. on Principles of Programming Languages, pages 303\u2013310, Jan. 1991.","DOI":"10.1145\/99583.99623"},{"key":"23_CR13","volume-title":"Technical Report PRG-TR-6-91","author":"Mark P. P. Jones","year":"1991","unstructured":"Mark P. Jones. Towards a theory of qualified types. Technical Report PRG-TR-6-91, Oxford University Computing Laboratory, Oxford, UK, 1991."},{"key":"23_CR14","volume-title":"Technical Report PRG-TR-10-91","author":"Mark P. P. Jones","year":"1991","unstructured":"Mark P. Jones. Type inference for qualified types. Technical Report PRG-TR-10-91, Oxford University Computing Laboratory, Oxford, UK, 1991."},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(88)90100-4","volume":"59","author":"Y. Lafont","year":"1988","unstructured":"Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157\u2013180, 1988.","journal-title":"Theoretical Computer Science"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"J. Lucassen and D.K. Gifford. Polymorphic effect systems. In Proc. 15th ACM Symp. on Principles of Programming Languages, pages 47\u201357, Jan. 1988.","DOI":"10.1145\/73560.73564"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"A. Neirynk, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Proc. 14th ACM Symp. on Principles of Programming Languages, pages 274\u2013283, Jan. 1987.","DOI":"10.1145\/41625.41650"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"M. Odersky. How to make destructive updates less destructive. In Proc. 18th ACM Symp. on Principles of Programming Languages, pages 25\u201336, Jan. 1991.","DOI":"10.1145\/99583.99590"},{"issue":"2","key":"23_CR19","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/3318.3323","volume":"5","author":"D. A. Schmidt","year":"1985","unstructured":"D.A. Schmidt. Detecting global variables in denotational specifications. ACM Transactions on Programming Languages and Systems, 5(2):299\u2013310, 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"V. Swarup, U.S. Reddy, and E. Ireland. Assignments for applictive languages. In Proc. ACM Conf. on Functional Programming Languages and Computer Architecture, August 1991.","DOI":"10.1007\/3540543961_10"},{"key":"23_CR21","unstructured":"J.-P. Talpin and P. Jouvelot. Type, effect and region reconstruction in polymorphic functional languages. In Workshop on Static Analysis of Equational, Functional, and Logic Programs, Bordeaux, Oct. 1991."},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"P. Wadler. Comprehending monads. In Proc. ACM Conf. on LISP and Functional Programming, pages 61\u201378, June 1990.","DOI":"10.1145\/91556.91592"},{"key":"23_CR23","unstructured":"Phil Wadler. Linear types can change the world! In Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, pages 547\u2013566, April 1990."},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"P. Wadler. Is there a use for linear logic? In Proc. ACM Symp. on Partial Evaluation and Semantic-Based Program Manipulation, pages 255\u2013273, June 1991.","DOI":"10.1145\/115865.115894"}],"container-title":["Lecture Notes in Computer Science","ESOP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55253-7_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:27Z","timestamp":1605646707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55253-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552536","9783540468035"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-55253-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}