{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:41:51Z","timestamp":1725727311014},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389450"},{"type":"electronic","value":"9783642389467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38946-7_4","type":"book-chapter","created":{"date-parts":[[2013,5,27]],"date-time":"2013-05-27T01:30:38Z","timestamp":1369618238000},"page":"15-30","source":"Crossref","is-referenced-by-count":2,"title":["System F i"],"prefix":"10.1007","author":[{"given":"Ki Yung","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Sheard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo","family":"Fiore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M.","family":"Pitts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-30124-0_17","volume-title":"Computer Science Logic","author":"A. Abel","year":"2004","unstructured":"Abel, A., Matthes, R.: Fixed points of type constructors and primitive recursion. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 190\u2013204. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.10.017","volume":"333","author":"A. Abel","year":"2005","unstructured":"Abel, A., Matthes, R., Uustalu, T.: Iteration and coiteration schemes for higher-order and nested datatypes. TCS\u00a0333(1-2), 3\u201366 (2005)","journal-title":"TCS"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ahn, K.Y., Sheard, T.: A hierarchy of Mendler-style recursion combinators: Taming inductive datatypes with negative occurrences. In: ICFP 2011, pp. 234\u2013246. ACM (2011)","DOI":"10.1145\/2034574.2034807"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-540-78499-9_26","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Barras","year":"2008","unstructured":"Barras, B., Bernardo, B.: The implicit calculus of constructions as a programming language with dependent types. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 365\u2013379. Springer, Heidelberg (2008)"},{"key":"4_CR5","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 lambda-programs on term algebras. TCS\u00a039, 135\u2013154 (1985)","journal-title":"TCS"},{"issue":"2","key":"4_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-2010-303","volume":"102","author":"E. Brady","year":"2010","unstructured":"Brady, E., Hammond, K.: Correct-by-construction concurrency: Using dependent types to verify implementations of effectful resource usage protocols. Fundam. Inform.\u00a0102(2), 145\u2013176 (2010)","journal-title":"Fundam. Inform."},{"key":"4_CR7","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Rapport de Recherche 530, INRIA, Rocquencourt, France (May 1986)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Crary, K., Weirich, S., Morrisett, G.: Intensional polymorphism in type-erasure semantics. In: ICFP 1998, pp. 301\u2013312. ACM (1998)","DOI":"10.1145\/291251.289459"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Dagand, P.E., McBride, C.: Transporting functions across ornaments. In: ICFP 1998, ICFP 2012, pp. 103\u2013114. ACM (2012)","DOI":"10.1145\/2398856.2364544"},{"key":"4_CR10","unstructured":"Garrigue, J., Normand, J.L.: Adding GADTs to OCaml: the direct approach. In: ML 2011. ACM (2011)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45413-6_16","volume-title":"Typed Lambda Calculi and Applications","author":"H. Geuvers","year":"2001","unstructured":"Geuvers, H.: Induction is not derivable in second order dependent type theory. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 166\u2013181. Springer, Heidelberg (2001)"},{"issue":"1\/2","key":"4_CR12","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., Rocca, S.R.D.: Type inference: Some results, some problems. Fundam. Inform.\u00a019(1\/2), 87\u2013125 (1993)","journal-title":"Fundam. Inform."},{"key":"4_CR13","unstructured":"Girard, J.-Y.: Interpr\u00e9tation Fonctionnelle et \u00c9limination des Coupures de l\u2019Arithm\u00e9tique d\u2019Ordre Sup\u00e9rieur. Th\u00e8se de doctorat d\u2019\u00e9tat, Universit\u00e9 Paris VII (June 1972)"},{"key":"4_CR14","unstructured":"McBride, C.: Homepage of the Strathclyde Haskell Enhancement (SHE) (2009), http:\/\/personal.cis.strath.ac.uk\/conor\/pub\/she\/"},{"key":"4_CR15","unstructured":"Miquel, A.: A model for impredicative type systems, universes, intersection types and subtyping. In: LICS, pp. 18\u201329. IEEE Computer Society (2000)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-45413-6_27","volume-title":"Typed Lambda Calculi and Applications","author":"A. Miquel","year":"2001","unstructured":"Miquel, A.: The implicit calculus of constructions. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 344\u2013359. Springer, Heidelberg (2001)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-78499-9_25","volume-title":"Foundations of Software Science and Computational Structures","author":"N. Mishra-Linger","year":"2008","unstructured":"Mishra-Linger, N., Sheard, T.: Erasure and polymorphism in pure type systems. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 350\u2013364. Springer, Heidelberg (2008)"},{"key":"4_CR18","unstructured":"Sheard, T., Pa\u0161ali\u0107, E.: Meta-programming with built-in type equality. In: LFM 2004, pp. 106\u2013124 (2004)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Yorgey, B.A., Weirich, S., Cretin, J., Jones, S.L.P., Vytiniotis, D., Magalh\u00e3es, J.P.: Giving Haskell a promotion. In: TLDI, pp. 53\u201366. ACM (2012)","DOI":"10.1145\/2103786.2103795"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38946-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T22:45:52Z","timestamp":1645569952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38946-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389450","9783642389467"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38946-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}