{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:02:02Z","timestamp":1725487322701},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421177"},{"type":"electronic","value":"9783540451273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45127-7_5","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:25:25Z","timestamp":1184588725000},"page":"31-46","source":"Crossref","is-referenced-by-count":3,"title":["Beta Reduction Constraints"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katrin","family":"Erk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Koller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,8]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"1","author":"M. Abadi","year":"1991","unstructured":"M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L\u00e9vy. Explicit substitutions. Journal of Functional Programming, 1(4):375\u2013416, 1991.","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01048403","volume":"4","author":"R. Backofen","year":"1995","unstructured":"R. Backofen, J. Rogers, and K. Vijay-Shanker. A first-order axiomatization of the theory of finite trees. J. Logic, Language, and Information, 4(1):5\u201339, 1995.","journal-title":"J. Logic, Language, and Information"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"M. Bodirsky, K. Erk, A. Koller, and J. Niehren. Beta reduction constraints, 2001. Full version. http:\/\/www.ps.uni-sb.de\/Papers\/abstracts\/beta.html .","DOI":"10.1007\/3-540-45127-7_5"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"M. Bodirsky, K. Erk, A. Koller, and J. Niehren. Underspecified beta reduction, 2001. Submitted. http:\/\/www.ps.uni-sb.de\/Papers\/abstracts\/usp-beta.html .","DOI":"10.3115\/1073012.1073023"},{"key":"5_CR5","series-title":"Lect Notes Comput Sci","volume-title":"First International Conference on Computational Logic (CL2000)","author":"D. Duchier","year":"2000","unstructured":"D. Duchier and J. Niehren. Dominance constraints with set operators. In First International Conference on Computational Logic (CL2000), LNCS, July 2000."},{"key":"5_CR6","unstructured":"M. Egg, A. Koller, and J. Niehren. The Constraint Language for Lambda Structures. Journal of Logic, Language, and Information, 2001. To appear."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"M. Egg, J. Niehren, P. Ruhrberg, and F. Xu. Constraints over lambda-structures in semantic underspecification. In In Proceedings COLING\/ACL\u201998, 1998.","DOI":"10.3115\/980451.980905"},{"key":"5_CR8","unstructured":"K. Erk, A. Koller, and J. Niehren. Processing underspecified semantic descriptions in CLLS. Journal of Language & Computation, 2001. To appear."},{"key":"5_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/10721975_8","volume-title":"Int. Conference on Rewriting Techniques and Applications","author":"K. Erk","year":"2000","unstructured":"K. Erk and J. Niehren. Parallelism constraints. In Int. Conference on Rewriting Techniques and Applications, volume 1833 of LNCS, pages 110\u2013126, 2000."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. P. Huet","year":"1975","unstructured":"G. P. Huet. A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science, 1:27\u201357, 1975.","journal-title":"Theoretical Computer Science"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"J. Lamping. An algorithm for optimal lambda calculus reduction. In ACM Symposium on Principles of Programming Languages, pages 16\u201330, 1990.","DOI":"10.1145\/96709.96711"},{"key":"5_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-61464-8_63","volume-title":"7th Int. Conference on Rewriting Techniques and Applications","author":"J. L\u00e9vy","year":"1996","unstructured":"J. L\u00e9vy. Linear second order unification. In 7th Int. Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 332\u2013346, 1996."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"M. P. Marcus, D. Hindle, and M. M. Fleck. D-theory: Talking about talking about trees. In Proceedings of the 21st ACL, pages 129\u2013136, 1983.","DOI":"10.3115\/981311.981337"},{"key":"5_CR14","unstructured":"M. Pinkal. Radical underspecification. In Proc. 10th Amsterdam Colloquium, 1996."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1093\/jos\/10.2.123","volume":"10","author":"U. Reyle","year":"1993","unstructured":"U. Reyle. Dealing with ambiguities by underspecification: construction, representation, and deduction. Journal of Semantics, 10:123\u2013179, 1993.","journal-title":"Journal of Semantics"},{"key":"5_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Int. Conf. on Automated Deduction","author":"M. Schmidt-Schau\u03b2","year":"1999","unstructured":"M. Schmidt-Schau\u03b2 and K. Schulz. Solvability of context equations with two context variables is decidable. In Int. Conf. on Automated Deduction, LNCS, 1999."},{"key":"5_CR17","volume-title":"Semantic Ambiguity and Underspecification","author":"K. Deemter van","year":"1996","unstructured":"K. van Deemter and S. Peters. Semantic Ambiguity and Underspecification. CSLI Press, Stanford, 1996."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45127-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:35:57Z","timestamp":1556667357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45127-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421177","9783540451273"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45127-7_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}