{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:21Z","timestamp":1742598621012,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592006"},{"type":"electronic","value":"9783540492238"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59200-8_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:06:18Z","timestamp":1330275978000},"page":"279-293","source":"Crossref","is-referenced-by-count":2,"title":["(Head-)normalization of typeable rewrite systems"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Bakel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(92)90297-S","volume":"102","author":"S. Bakel van","year":"1992","unstructured":"S. van Bakel. Complete restrictions of the Intersection Type Discipline. Theoretical Computer Science, 102:135\u2013163, 1992.","journal-title":"Theoretical Computer Science"},{"key":"23_CR2","unstructured":"S. van Bakel. Partial Intersection Type Assignment of Rank 2 in Applicative Term Rewriting Systems. Technical Report 92-03, Department of Computer Science, University of Nijmegen, 1992."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"S. van Bakel. Partial Intersection Type Assignment in Applicative Term Rewriting Systems. In Proceedings of TLCA\u2019 93. International Conference on Typed Lambda Calculi and Applications, Utrecht, the Netherlands, volume 664 of LNCS, pages 29\u201344. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0037096"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"S. van Bakel and M. Fern\u00e1ndez. Strong Normalization of Typeable Rewrite Systems. In Proceedings of HOA\u2019 93. First International Workshop on Higher Order Algebra, Logic and Term Rewriting, Amsterdam, the Netherlands. Selected Papers, volume 816 of LNCS, pages 20\u201339. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58233-9_2"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"F. Barbanera and M. Fern\u00e1ndez. Combining first and higher order rewrite systems with type assignment systems. In Proceedings of TLCA\u2019 93. International Conference on Typed Lambda Calculi and Applications, Utrecht, the Netherlands, volume 664 of LNCS, pages 60\u201374. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0037098"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"F. Barbanera, M. Fern\u00e1ndez, and H. Geuvers. Modularity of Strong Normalization and Confluence in the \u03bb-algebraic-cube. In Proceedings of the ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, 1994.","DOI":"10.1109\/LICS.1994.316049"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48(4), 1983.","DOI":"10.2307\/2273659"},{"key":"23_CR8","volume-title":"Combinatory Logic, volume 1","author":"H.B. Curry","year":"1958","unstructured":"H.B. Curry and R. Feys. Combinatory Logic, volume 1. North-Holland, Amsterdam, 1958."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume B, chapter 6, pages 245\u2013320. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"23_CR10","unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"J.P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pages 350\u2013361, 1991. 12. J.W. Klop. Term Rewriting Systems. In Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1\u2013116. Clarendon Press, 1992.","DOI":"10.1109\/LICS.1991.151659"},{"issue":"2","key":"23_CR12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.2307\/2271658","volume":"32","author":"W.W. Tait","year":"1967","unstructured":"W.W. Tait. Intensional interpretation of functional of finite type I. Journal of Symbolic Logic, 32(2):198\u2013223, 1967.","journal-title":"Journal of Symbolic Logic"}],"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-59200-8_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:43:55Z","timestamp":1742597035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59200-8_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592006","9783540492238"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-59200-8_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}