乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:07:07Z","timestamp":1742958427329,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_17","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T12:27:59Z","timestamp":1267532879000},"page":"190-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fixed Points of Type Constructors and Primitive Recursion"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Abel","sequence":"first","affiliation":[]},{"given":"Ralph","family":"Matthes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36576-1_4","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Abel","year":"2003","unstructured":"Abel, A., Matthes, R., Uustalu, T.: Generalized iteration and coiteration for higher-order nested datatypes. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 54\u201369. Springer, Heidelberg (2003)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abel, A., Matthes, R., Uustalu, T.: Iteration and coiteration schemes for higher-order and nested datatypes. Theoretical Computer Science, 79 pages, accepted for publication (2004)","DOI":"10.1007\/3-540-36576-1_4"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-48168-0_32","volume-title":"Computer Science Logic","author":"T. Altenkirch","year":"1999","unstructured":"Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 453\u2013468. Springer, Heidelberg (1999)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(85)90135-5","volume":"39","author":"C. B\u00f6hm","year":"1985","unstructured":"B\u00f6hm, C., Berarducci, A.: Automatic synthesis of typed \u03bb-programs on term algebras. Theoretical Computer Science\u00a039, 135\u2013154 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s001650050047","volume":"11","author":"R. Bird","year":"1999","unstructured":"Bird, R., Paterson, R.: Generalised folds for nested datatypes. Formal Aspects of Computing\u00a011(2), 200\u2013222 (1999)","journal-title":"Formal Aspects of Computing"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1017\/S0956796899003366","volume":"9","author":"R.S. Bird","year":"1999","unstructured":"Bird, R.S., Paterson, R.: De Bruijn notation as a nested datatype. Journal of Functional Programming\u00a09(1), 77\u201391 (1999)","journal-title":"Journal of Functional Programming"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-52335-9_47","volume-title":"COLOG-88","author":"T. Coquand","year":"1990","unstructured":"Coquand, T., Paulin, C.: Inductively defined types\u2014preliminary version. In: Martin-L\u00f6f, P., Mints, G. (eds.) COLOG 1988. LNCS, vol.\u00a0417, pp. 50\u201366. Springer, Heidelberg (1990)"},{"key":"17_CR8","unstructured":"Duggan, D., Compagnoni, A.: Subtyping for object type constructors. Presented at FOOL\u00a06 (1998)"},{"issue":"1-2","key":"17_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3233\/FI-1993-191-205","volume":"19","author":"P. Giannini","year":"1993","unstructured":"Giannini, P., Honsell, F., Ronchi Della Rocca, S.: Type inference: some results, some problems. Fundamenta Informaticae\u00a019(1-2), 87\u2013125 (1993)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BFb0014053","volume-title":"Typed Lambda Calculi and Applications","author":"H. Goguen","year":"1995","unstructured":"Goguen, H.: Typed operational semantics. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 186\u2013200. Springer, Heidelberg (1995)"},{"key":"17_CR11","unstructured":"Hinze, R.: Numerical representations as higher-order nested datatypes. Tech. Rep. IAI-TR-98-12, Institut f\u00fcr Informatik III, Universit\u00e4t Bonn (1998)"},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1017\/S095679680100404X","volume":"11","author":"R. Hinze","year":"2001","unstructured":"Hinze, R.: Manufacturing datatypes. Journal of Functional Programming\u00a011(5), 493\u2013524 (2001)","journal-title":"Journal of Functional Programming"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/3-540-44802-0_42","volume-title":"Computer Science Logic","author":"R. Matthes","year":"2001","unstructured":"Matthes, R.: Monotone inductive and coinductive constructors of rank 2. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 600\u2013614. Springer, Heidelberg (2001)"},{"key":"17_CR14","unstructured":"Mendler, N.P.: Recursive types and type constraints in second-order lambda calculus. In: Proceedings of LICS 1987, pp. 30\u201336 (1987)"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00165-003-0013-6","volume":"16","author":"C. Martin","year":"2004","unstructured":"Martin, C., Gibbons, J., Bayley, I.: Disciplined, efficient, generalised folds for nested datatypes. Formal Aspects of Computing\u00a016(1), 19\u201335 (2004)","journal-title":"Formal Aspects of Computing"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely Functional Data Structures. Ph.D. thesis, Carnegie Mellon University (1996)","DOI":"10.1007\/3-540-61628-4_5"},{"issue":"4","key":"17_CR17","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1017\/S0956796899003494","volume":"9","author":"C. Okasaki","year":"1999","unstructured":"Okasaki, C.: Red-black trees in a functional setting. Journal of Functional Programming\u00a09(4), 471\u2013477 (1999)","journal-title":"Journal of Functional Programming"},{"key":"17_CR18","unstructured":"Steffen, M.: Polarized Higher-Order Subtyping. Ph.D. thesis, Technische Fakult\u00e4t, Universit\u00e4t Erlangen (1998)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Sp\u0142awski, Z., Urzyczyn, P.: Type fixpoints: Iteration vs. recursion. In: Proceedings of ICFP 1999. SIGPLAN Notices, pp. 102\u2013113 (1999)","DOI":"10.1145\/317765.317789"},{"issue":"1\u20132","key":"17_CR20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.3233\/FI-1996-281213","volume":"28","author":"P. Urzyczyn","year":"1996","unstructured":"Urzyczyn, P.: Positive recursive type assignment. Fundamenta Informaticae\u00a028(1\u20132), 197\u2013209 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR21","unstructured":"Uustalu, T., Vene, V.: The dual of substitution is redecoration. In: Hammond, K., Curtis, S. (eds.) Trends in Functional Programming, Intellect, Bristol, Portland, OR, vol.\u00a03, pp. 99\u2013110 (2002)"},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0168-0072(96)00036-X","volume":"86","author":"S. Bakel van","year":"1997","unstructured":"van Bakel, S., Liquori, L., Ronchi Della Rocca, S., Urzyczyn, P.: Comparing cubes of typed and type assignment systems. Annals of Pure and Applied Logic\u00a086(3), 267\u2013303 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"17_CR23","unstructured":"van Raamsdonk, F., Severi, P.: On normalisation. Tech. Rep. CS-R9545, CWI (1995)"},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/inco.1998.2750","volume":"149","author":"F. Raamsdonk van","year":"1999","unstructured":"van Raamsdonk, F., Severi, P., S\u00f8rensen, M.H., Xi, H.: Perpetual reductions in lambda calculus. Inf. and Comp.\u00a0149(2), 173\u2013225 (1999)","journal-title":"Inf. and Comp."}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T03:17:28Z","timestamp":1635045448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_17","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"}}]}}