{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:59Z","timestamp":1725664979978},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_102","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:21:26Z","timestamp":1330294886000},"page":"438-453","source":"Crossref","is-referenced-by-count":0,"title":["Integrating efficient records into concurrent constraint programming"],"prefix":"10.1007","author":[{"given":"Peter","family":"Roy","sequence":"first","affiliation":[]},{"given":"Michael","family":"Mehl","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Scheidhauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Hassan A\u00eft-Kaci. Warren's Abstract Machine, A Tutorial Reconstruction. MIT Press, 1991.","DOI":"10.7551\/mitpress\/7160.001.0001"},{"key":"30_CR2","volume-title":"Technical Report ACA-ST-074-88","author":"H. A\u00eft-Kaci","year":"1988","unstructured":"Hassan A\u00eft-Kaci and Pat Lincoln. LIFE: A natural language for natural language. Technical Report ACA-ST-074-88, MCC, Austin, TX, 1988."},{"key":"30_CR3","unstructured":"Hassan A\u00eft-Kaci, Andreas Podelski, and Gert Smolka. A feature-based constraint system for logic programming with entailment. In 5th FGCS, pages 1012\u20131022, 1992."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"L. Peter Deutsch. Efficient implementation of the Smalltalk-80 system. In 11th Principles of Programming Languages, January 1984.","DOI":"10.1145\/800017.800542"},{"key":"30_CR5","unstructured":"Gerard Ellis and Peter Van Roy. Compilation of matching in LIFE. DEC PRL draft report, May 1992."},{"key":"30_CR6","unstructured":"Gregor Erbach and Suresh Manandhar. Visions for logic-based natural language processing. In Workshop on the Future of Logic Programming, ILPS 95, December 1995."},{"key":"30_CR7","unstructured":"Seth Copen Goldstein. An abstract machine to implement functions in LIFE. DEC PRL technical note 18, January 1993."},{"key":"30_CR8","unstructured":"Michael J. Maher. Logic semantics for a class of committed-choice programs. In Jean-Louis Lassez, editor, Logic Programming, Proceedings of the Fourth International Conference, pages 858\u2013876. MIT Press, 1987."},{"key":"30_CR9","unstructured":"David Maier and David Scott Warren. Computing with Logic, Logic Programming with Prolog. Benjamin Cummings, 1988."},{"key":"30_CR10","first-page":"151","volume-title":"Lecture Notes in Computer Science, vol. 982","author":"M. Mehl","year":"1995","unstructured":"Michael Mehl, Ralf Scheidhauer, and Christian Schulte. An Abstract Machine for Oz. In Manuel Hermenegildo and S. Doaitse Swierstra, editors, Programming Languages: Implementations, Logics and Programs, 7th International Symposium, PLILP'95, Lecture Notes in Computer Science, vol. 982, pages 151\u2013168, Utrecht, The Netherlands, September 1995. Springer-Verlag."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Micha Meier. Better later than never. In Implementation of Logic Programming Systems, pages 151\u2013165. Kluwer Academic Publishers, 1994.","DOI":"10.1007\/978-1-4615-2690-2_11"},{"key":"30_CR12","unstructured":"Richard Meyer. Compiling LIFE. DEA report, DEC PRL draft report, September 1993."},{"key":"30_CR13","unstructured":"Richard Meyer, Bruno Dumant, and Peter Van Roy. The Half-Life 0.1 system. Available at http:\/\/ps-www.dfki.uni-sb.de\/\u223cvanroy\/halflife.html, 1994."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Andreas Podelski and Peter Van Roy. The Beauty and the Beast algorithm: Quasi-linear incremental tests of entailment and disentailment over trees. In 11th ILPS, pages 359\u2013374, November 1994.","DOI":"10.1007\/3-540-59479-5_16"},{"key":"30_CR15","unstructured":"SICS Programming Systems Group. SICStus Prolog User's Manual. Swedish Institute of Computer Science, 1995."},{"key":"30_CR16","unstructured":"DFKI Programming Systems Lab. DFKI Oz System and Documentation. German Research Center for Artificial Intelligence (DFKI), 1995."},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Vijay A. Saraswat. Concurrent Constraint Programming. MIT Press, 1993.","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science, vol. 1000","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/BFb0015252","volume-title":"Computer Science Today","author":"G. Smolka","year":"1995","unstructured":"Gert Smolka. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pages 324\u2013343. Springer-Verlag, Berlin, 1995."},{"issue":"3","key":"30_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G. Smolka","year":"1994","unstructured":"Gert Smolka and Ralf Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229\u2013258, April 1994.","journal-title":"Journal of Logic Programming"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science, vol. 711","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1007\/3-540-57182-5_64","volume-title":"Mathematical Foundations of Computer Science","author":"R. Treinen","year":"1993","unstructured":"Ralf Treinen. Feature constraints with first-class features. In Andrzej M. Borzyszkowski and Stefan Sokolowski, editors, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 711, pages 734\u2013743, Gda\u0144sk, Poland, 30 August\u20133 September 1993. Springer-Verlag."},{"key":"30_CR21","unstructured":"Ralf Treinen. Feature trees over arbitrary structures. Studies in Logic, Language and Information. 1995. To appear."},{"key":"30_CR22","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0743-1066(94)90031-0","volume":"19\/20","author":"P. Roy Van","year":"1994","unstructured":"Peter Van Roy. 1983\u20131993: The wonder years of sequential Prolog implementation. Journal of Logic Programming, 19\/20:385\u2013441, May\/July 1994.","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_102.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:01:48Z","timestamp":1640948508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}