{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:41Z","timestamp":1772163941248,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1145\/1291151.1291156","type":"proceedings-article","created":{"date-parts":[[2007,10,14]],"date-time":"2007-10-14T08:51:38Z","timestamp":1192351898000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Program-ing finger trees in C\n                    <scp>oq<\/scp>"],"prefix":"10.1145","author":[{"given":"Matthieu","family":"Sozeau","sequence":"first","affiliation":[{"name":"LRI: Universit\u00e9 Paris Sud, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Edwin\n      Brady Conor\n      McBride and \n      James\n      McKinna\n    .\n  Inductive families need not store their indices\n  . In Stefano Berardi Mario Coppo and Ferruccio Damiani editors TYPES volume \n  3085\n   of \n  LNCS pages \n  115\n  --\n  129\n  . \n  Springer 2003\n  .  Edwin Brady Conor McBride and James McKinna. Inductive families need not store their indices. In Stefano Berardi Mario Coppo and Ferruccio Damiani editors TYPES volume 3085 of LNCS pages 115--129. Springer 2003.","DOI":"10.1007\/978-3-540-24849-1_8"},{"key":"e_1_3_2_1_2_1","volume-title":"PLPV'06: Proceedings of the Programming Languages meets Program Verification Workshop","author":"Chlipala Adam","year":"2006","unstructured":"Adam Chlipala . Position paper : Thoughts on programming with proof assistants . In PLPV'06: Proceedings of the Programming Languages meets Program Verification Workshop , August 2006 . Adam Chlipala. Position paper: Thoughts on programming with proof assistants. In PLPV'06: Proceedings of the Programming Languages meets Program Verification Workshop, August 2006."},{"key":"e_1_3_2_1_3_1","unstructured":"Coq. The Coq proof assistant. coq.inria.fr.  Coq. The Coq proof assistant. coq.inria.fr."},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","first-page":"50","volume-title":"Freek Wiedijk","author":"Coquand Thierry","year":"2006","unstructured":"Thierry Coquand . Alfa\/agda. In Freek Wiedijk , editor, The Seventeen Provers of the World, volume 3600 of LNCS , pages 50 -- 54 . Springer , 2006 . Thierry Coquand. Alfa\/agda. In Freek Wiedijk, editor, The Seventeen Provers of the World, volume 3600 of LNCS, pages 50--54. Springer, 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Jean-Christophe\n      Filli\u00e2tre\n     and \n      Pierre\n      Letouzey\n    .\n  Functors for proofs and programs\n  . In David A. Schmidt editor ESOP volume \n  2986\n   of \n  LNCS pages \n  370\n  --\n  384\n  . \n  Springer 2004\n  .  Jean-Christophe Filli\u00e2tre and Pierre Letouzey. Functors for proofs and programs. In David A. Schmidt editor ESOP volume 2986 of LNCS pages 370--384. Springer 2004.","DOI":"10.1007\/978-3-540-24725-8_26"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244400"},{"key":"e_1_3_2_1_7_1","unstructured":"Haskell. The Haskell programming language. haskell.org.  Haskell. The Haskell programming language. haskell.org."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796805005769"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Pierre\n      Letouzey\n    .\n  A new extraction for coq\n  . In Herman Geuvers and Freek Wiedijk editors TYPES'02 volume \n  2646\n   of \n  LNCS pages \n  200\n  --\n  219\n  . \n  Springer 2002\n  .   Pierre Letouzey. A new extraction for coq. In Herman Geuvers and Freek Wiedijk editors TYPES'02 volume 2646 of LNCS pages 200--219. Springer 2002.","DOI":"10.1007\/3-540-39185-1_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004829"},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"344","volume-title":"TLCA","author":"Miquel Alexandre","year":"2001","unstructured":"Alexandre Miquel . The implicit calculus of constructions . In TLCA , volume 2044 of LNCS , pages 344 -- 359 . Springer , 2001 . Alexandre Miquel. The implicit calculus of constructions. In TLCA, volume 2044 of LNCS, pages 344--359. Springer, 2001."},{"key":"e_1_3_2_1_13_1","unstructured":"OCaml. The Ocaml programming language. caml.inria.fr.  OCaml. The Ocaml programming language. caml.inria.fr."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Catherine\n      Parent\n    .\n  Synthesizing proofs from programs in the Calculus of Inductive Constructions\n  . In Bernhard M\u00f6ller editor MPC volume \n  947\n   of \n  LNCS pages \n  351\n  --\n  379\n  . \n  Springer 1995\n  .   Catherine Parent. Synthesizing proofs from programs in the Calculus of Inductive Constructions. In Bernhard M\u00f6ller editor MPC volume 947 of LNCS pages 351--379. Springer 1995.","DOI":"10.1007\/3-540-60117-1_20"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/BFb0037116","volume-title":"Typed Lambda Calculi and Applications","author":"Paulin-Mohring Christine","year":"1993","unstructured":"Christine Paulin-Mohring . Inductive definitions in the system COQ . In Typed Lambda Calculi and Applications , volume 664 of LNCS , pages 328 -- 345 . Springer , 1993 . Christine Paulin-Mohring. Inductive definitions in the system COQ. In Typed Lambda Calculi and Applications, volume 664 of LNCS, pages 328--345. Springer, 1993."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052883.1052897"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"237","volume-title":"TYPES'06","author":"Sozeau Matthieu","year":"2007","unstructured":"Matthieu Sozeau . Subset coercions in Coq . In TYPES'06 , volume 4502 of LNCS , pages 237 -- 252 . Springer , 2007 . Matthieu Sozeau. Subset coercions in Coq. In TYPES'06, volume 4502 of LNCS, pages 237--252. Springer, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_49"},{"key":"e_1_3_2_1_20_1","first-page":"394","volume-title":"Applied Type System (extended abstract). In post-workshop Proceedings of TYPES","author":"Xi Hongwei","year":"2003","unstructured":"Hongwei Xi . Applied Type System (extended abstract). In post-workshop Proceedings of TYPES 2003 , pages 394 -- 408 . Springer-Verlag LNCS 3085, 2004. Hongwei Xi. Applied Type System (extended abstract). In post-workshop Proceedings of TYPES 2003, pages 394--408. Springer-Verlag LNCS 3085, 2004."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292560"}],"event":{"name":"ICFP07: ACM SIGPLAN International Conference on Functional Programming","location":"Freiburg Germany","acronym":"ICFP07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 12th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1291151.1291156","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1291151.1291156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:25Z","timestamp":1750243945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1291151.1291156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":19,"alternative-id":["10.1145\/1291151.1291156","10.1145\/1291151"],"URL":"https:\/\/doi.org\/10.1145\/1291151.1291156","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1291220.1291156","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,10]]},"assertion":[{"value":"2007-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}