{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:28:23Z","timestamp":1743146903514,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230243"},{"type":"electronic","value":"9783540301240"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_18","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T17:27:59Z","timestamp":1267550879000},"page":"205-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Building of Affine Retractions"],"prefix":"10.1007","author":[{"given":"Aleksy","family":"Schubert","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Barendregt, H.P.: Lambda calculi with types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a02, pp. 117\u2013309. Oxford Science Publications (1992)","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bruce, K., Longo, G.: Provable isomorphisms and domain equations in models of typed languages. In: ACM Symposium on Theory of Computing (STOC 1985) (May 1985)","DOI":"10.1145\/22145.22175"},{"key":"18_CR3","volume-title":"Introduction to algorithms, ch. 27","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms, ch. 27. MIT Press, Cambridge (1990)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Di Cosmo, R.: Isomorphisms of types: from lambda-calculus to information retrieval and language design, Birkhauser (1995)","DOI":"10.1007\/978-1-4612-2572-0"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"De\u2019Liguoro, U., Piperno, A., Statman, R.: Retracts in Simply Typed \u03bb\u03b2\u03b7-Calculus. In: Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, pp. 461\u2013469 (1992)","DOI":"10.1109\/LICS.1992.185557"},{"key":"18_CR6","unstructured":"Regnier, P.U.L.: Retractions of types with many atoms, Warsaw University. Tech. report, Institute of Informatics (2001)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-45413-6_29","volume-title":"Typed Lambda Calculi and Applications","author":"V. Padovani","year":"2001","unstructured":"Padovani, V.: Retracts in simple types. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 376\u2013384. Springer, Heidelberg (2001)"},{"issue":"1","key":"18_CR8","first-page":"71","volume":"1","author":"M. Rittri","year":"1991","unstructured":"Rittri, M.: Using types as search keys in function libraries. Using types as search keys in function libraries\u00a01(1), 71\u201389 (1991)","journal-title":"Using types as search keys in function libraries"},{"key":"18_CR9","first-page":"102","volume-title":"Proceedings of 4th International Conference on Functional Programming","author":"Z. Sp\u0142awski","year":"1999","unstructured":"Sp\u0142awski, Z., Urzyczyn, P.: Type fixpoints: Iteration vs. recursion. In: Proceedings of 4th International Conference on Functional Programming, pp. 102\u2013113. ACM, New York (1999)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Vorobyov, S.: The \u201dHardest\u201d Natural Decidable Theory. In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 294\u2013305 (1997)","DOI":"10.1109\/LICS.1997.614956"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-45610-4_24","volume-title":"Rewriting Techniques and Applications","author":"D. Dougherty","year":"2002","unstructured":"Dougherty, D., Wierzbicki, T.: A decidable variant of higher order matching. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 340\u2013351. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:00:49Z","timestamp":1739919649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}