{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:48:42Z","timestamp":1762458522611},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677789"},{"type":"electronic","value":"9783540449805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721975_10","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T15:43:04Z","timestamp":1167406984000},"page":"141-155","source":"Crossref","is-referenced-by-count":10,"title":["Standardization and Confluence for a Lambda Calculus with Generalized Applications"],"prefix":"10.1007","author":[{"given":"Felix","family":"Joachimski","sequence":"first","affiliation":[]},{"given":"Ralph","family":"Matthes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. second revised edn. North- Holland, Amsterdam (1984)"},{"key":"10_CR2","unstructured":"David, R.: Une preuve simple de r\u00e9sultats classiques en \u03bb calcul. C.R. Acad. Sci. Paris, t. 320\u00a0S\u00e9rie I, 1401\u20131406 (1995)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-48685-2_4","volume-title":"Rewriting Techniques and Applications","author":"P. Groote de","year":"1999","unstructured":"de Groote, P.: On the strong normalisation of natural deduction with permutation-conversions. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 45\u201359. Springer, Heidelberg (1999)"},{"key":"10_CR4","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol.\u00a07. Cambridge University Press, Cambridge (1989)"},{"key":"10_CR5","unstructured":"Joachimski, F., Matthes, R.: Short proofs of normalization for the simplytyped lambda-calculus, permutative conversions and G\u00f6del\u2019s T. Submitted to the Archive for Mathematical Logic (1999)"},{"key":"10_CR6","unstructured":"Loader, R.: Notes on simply typed lambda calculus. Reports of the Laboratory for Foundations of Computer Science ECS-LFCS-98-381. University of Edinburgh, Edinburgh (1998)"},{"key":"10_CR7","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BFb0079555","volume-title":"Proof Theory Symposion Kiel 1974","author":"W. Maa\u00df","year":"1975","unstructured":"Maa\u00df, W.: Church Rosser Theorem f\u00fcr \u03bb-Kalk\u00fcle mit unendlich langen Termen. In: Diller, J., M\u00fcller, G.H. (eds.) Proof Theory Symposion Kiel 1974. Lecture Notes in Mathematics, vol.\u00a0500, pp. 257\u2013263. Springer, Heidelberg (1975)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(97)00143-6","volume":"192","author":"R. Mayr","year":"1998","unstructured":"Mayr, R., Nipkow, T.: Higher-order rewrite systems and their confluence. Theoretical Computer Science\u00a0192, 3\u201329 (1998)","journal-title":"Theoretical Computer Science"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/S0049-237X(08)71689-6","volume-title":"Formal Systems and Recursive Functions","author":"W.W. Tait","year":"1965","unstructured":"Tait, W.W.: Infinitely long terms of transfinite type. In: Crossley, J., Dummett, M. (eds.) Formal Systems and Recursive Functions, pp. 176\u2013185. North-Holland, Amsterdam (1965)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1006\/inco.1995.1057","volume":"118","author":"M. Takahashi","year":"1995","unstructured":"Takahashi, M.: Parallel reduction in \u03bb-calculus. Information and Computation\u00a0118(1), 120\u2013127 (1995)","journal-title":"Information and Computation"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-61254-8_26","volume-title":"Higher-Order Algebra, Logic, and Term Rewriting","author":"V. Oostrom van","year":"1996","unstructured":"van Oostrom, V.: Development closed critical pairs. In: Dowek, G., Heering, J., Meinke, K., M\u00f6ller, B. (eds.) HOA 1995. LNCS, vol.\u00a01074, pp. 185\u2013200. Springer, Heidelberg (1996)"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00173-9","volume":"175","author":"V. Oostrom van","year":"1997","unstructured":"van Oostrom, V.: Developing developments. Theoretical Computer Science\u00a0175(1), 159\u2013181 (1997)","journal-title":"Theoretical Computer Science"},{"key":"10_CR13","unstructured":"van Raamsdonk, F.: Confluence and Normalisation for Higher-Order Rewriting. Academisch Proefschrift (PhD thesis), Vrije Universiteit te Amsterdam (1996)"},{"key":"10_CR14","unstructured":"von Plato, J.: Natural deduction with general elimination rules. (1998) (submitted)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721975_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T05:34:49Z","timestamp":1553319289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721975_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677789","9783540449805"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/10721975_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}