{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:58Z","timestamp":1750307998742,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T00:00:00Z","timestamp":1152489600000},"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":[[2006,7,10]]},"DOI":"10.1145\/1140335.1140348","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Extracting programs from type class proofs"],"prefix":"10.1145","author":[{"given":"Martin","family":"Sulzmann","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2006,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017444"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165191"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/291677.291678"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086397"},{"key":"e_1_3_2_1_5_1","first-page":"174","volume-title":"Proc. of the Fourth International Conference on Principles and Practices of Constraint Programming, LNCS","author":"Demoen B.","year":"1999","unstructured":"B. Demoen , M. Garc\u00eda de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. An overview of HAL . In Proc. of the Fourth International Conference on Principles and Practices of Constraint Programming, LNCS , pages 174 -- 188 . Springer , October 1999 .]] B. Demoen, M. Garc\u00eda de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. An overview of HAL. In Proc. of the Fourth International Conference on Principles and Practices of Constraint Programming, LNCS, pages 174--188. Springer, October 1999.]]"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"49","volume-title":"Proc. of ESOP'04","author":"Duck G. J.","year":"2004","unstructured":"G. J. Duck , S. Peyton Jones , P. J. Stuckey , and M. Sulzmann . Sound and decidable type inference for functional dependencies . In Proc. of ESOP'04 , volume 2986 of LNCS , pages 49 -- 63 . Springer-Verlag , 2004 .]] G. J. Duck, S. Peyton Jones, P. J. Stuckey, and M. Sulzmann. Sound and decidable type inference for functional dependencies. In Proc. of ESOP'04, volume 2986 of LNCS, pages 49--63. Springer-Verlag, 2004.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004380"},{"key":"e_1_3_2_1_8_1","volume-title":"Constraint Programming: Basics and Trends","author":"Fr\u00fchwirth T.","year":"1995","unstructured":"T. Fr\u00fchwirth . Constraint handling rules . In Constraint Programming: Basics and Trends , LNCS. Springer-Verlag , 1995 .]] T. Fr\u00fchwirth. Constraint handling rules. In Constraint Programming: Basics and Trends, LNCS. Springer-Verlag, 1995.]]"},{"key":"e_1_3_2_1_9_1","unstructured":"Glasgow haskell compiler home page. http:\/\/www.haskell.org\/ghc\/.]]  Glasgow haskell compiler home page. http:\/\/www.haskell.org\/ghc\/.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/227699.227700"},{"key":"e_1_3_2_1_11_1","first-page":"194","volume-title":"Proceedings 2nd Annual IEEE Symp. on Logic in Computer Science, LICS'87","author":"Harper R.","year":"1987","unstructured":"R. Harper , F. Honsell , and G. Plotkin . A Framework for Defining Logics . In Proceedings 2nd Annual IEEE Symp. on Logic in Computer Science, LICS'87 , pages 194 -- 204 . IEEE Computer Society Press , 1987 .]] R. Harper, F. Honsell, and G. Plotkin. A Framework for Defining Logics. In Proceedings 2nd Annual IEEE Symp. on Logic in Computer Science, LICS'87, pages 194--204. IEEE Computer Society Press, 1987.]]"},{"key":"e_1_3_2_1_12_1","volume-title":"The Mercury language reference manual","author":"Henderson F.","year":"2001","unstructured":"F. Henderson The Mercury language reference manual , 2001 . http:\/\/www.cs.mu.oz.au\/research\/mercury\/.]] F. Henderson et al. The Mercury language reference manual, 2001. http:\/\/www.cs.mu.oz.au\/research\/mercury\/.]]"},{"key":"e_1_3_2_1_13_1","first-page":"479","volume-title":"To H. B. Curry: Essays on Combinatory Logic, \u03bb Calculus and Formalism","author":"Howard W.A.","year":"1980","unstructured":"W.A. Howard . The formulae-as-types notion of construction . In J.P. Seldin and J.R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, \u03bb Calculus and Formalism , pages 479 -- 490 . Academic Press , 1980 .]] W.A. Howard. The formulae-as-types notion of construction. In J.P. Seldin and J.R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, \u03bb Calculus and Formalism, pages 479--490. Academic Press, 1980.]]"},{"key":"e_1_3_2_1_14_1","unstructured":"Hugs home page. haskell.cs.yale.edu\/hugs\/.]]  Hugs home page. haskell.cs.yale.edu\/hugs\/.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. Twenty-Third Australasian Computer Science Conf.","volume":"22","author":"Jeffery D.","year":"2000","unstructured":"D. Jeffery , F. Henderson , and Z. Somogyi . Type classes in Mercury . In Proc. Twenty-Third Australasian Computer Science Conf. , volume 22 of Australian Computer Science Communications, pages 128--135. IEEE Computer Society Press , January 2000 .]] D. Jeffery, F. Henderson, and Z. Somogyi. Type classes in Mercury. In Proc. Twenty-Third Australasian Computer Science Conf., volume 22 of Australian Computer Science Communications, pages 128--135. IEEE Computer Society Press, January 2000.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165190"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224198"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","volume-title":"Proc. of ESOP'00","author":"Jones M. P.","year":"2000","unstructured":"M. P. Jones . Type classes with functional dependencies . In Proc. of ESOP'00 , volume 1782 of LNCS . Springer-Verlag , 2000 .]] M. P. Jones. Type classes with functional dependencies. In Proc. of ESOP'00, volume 1782 of LNCS. Springer-Verlag, 2000.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645387.651547"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086391"},{"key":"e_1_3_2_1_21_1","volume-title":"Foundations of Deductive Databases and Logic Programming. Morgan Kauffman","author":"Lassez J.","year":"1987","unstructured":"J. Lassez , M. Maher , and K. Marriott . Unification revisited . In Foundations of Deductive Databases and Logic Programming. Morgan Kauffman , 1987 .]] J. Lassez, M. Maher, and K. Marriott. Unification revisited. In Foundations of Deductive Databases and Logic Programming. Morgan Kauffman, 1987.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30477-7_5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80019-5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155112"},{"key":"e_1_3_2_1_26_1","volume-title":"Haskell 98 Language and Libraries: The Revised Report","author":"Peyton Jones S.","year":"2003","unstructured":"S. Peyton Jones . Haskell 98 Language and Libraries: The Revised Report , 2003 . Also see http:\/\/www.haskell.org\/definition\/.]] S. Peyton Jones. Haskell 98 Language and Libraries: The Revised Report, 2003. Also see http:\/\/www.haskell.org\/definition\/.]]"},{"key":"e_1_3_2_1_27_1","volume-title":"Haskell Workshop","author":"Peyton Jones S.","year":"1997","unstructured":"S. Peyton Jones , M. P. Jones , and E. Meijer . Type classes: an exploration of the design space . In Haskell Workshop , June 1997 .]] S. Peyton Jones, M. P. Jones, and E. Meijer. Type classes: an exploration of the design space. In Haskell Workshop, June 1997.]]"},{"key":"e_1_3_2_1_29_1","unstructured":"F. Pottier 2004. personal communication.]]  F. Pottier 2004. personal communication.]]"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of ACM SIGPLAN Workshop on Types in Compilation (TIC'97)","author":"Shao Z.","year":"1997","unstructured":"Z. Shao . An overview of the FLINT\/ML compiler . In Proc. of ACM SIGPLAN Workshop on Types in Compilation (TIC'97) , 1997 .]] Z. Shao. An overview of the FLINT\/ML compiler. In Proc. of ACM SIGPLAN Workshop on Types in Compilation (TIC'97), 1997.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1053468.1053469"},{"key":"e_1_3_2_1_32_1","volume-title":"Mathematical Logic","author":"Shoenfield J.R.","year":"1967","unstructured":"J.R. Shoenfield . Mathematical Logic . Addison-Wesley , 1967 .]] J.R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.]]"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108970.1108974"},{"key":"e_1_3_2_1_34_1","unstructured":"M. Sulzmann and J. Wazny. Chameleon. http:\/\/www.comp.nus.edu.sg\/~sulzmann\/chameleon.]]  M. Sulzmann and J. Wazny. Chameleon. http:\/\/www.comp.nus.edu.sg\/~sulzmann\/chameleon.]]"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.182459"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75283"},{"key":"e_1_3_2_1_37_1","unstructured":"S. Wehr 2005. http:\/\/www.haskell.org\/\/pipermail\/haskell\/2005-October\/016695.html.]]  S. Wehr 2005. http:\/\/www.haskell.org\/\/pipermail\/haskell\/2005-October\/016695.html.]]"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1093"}],"event":{"name":"PPDP06: Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Venice Italy","acronym":"PPDP06"},"container-title":["Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140335.1140348","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1140335.1140348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:24Z","timestamp":1750259184000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140335.1140348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,10]]},"references-count":37,"alternative-id":["10.1145\/1140335.1140348","10.1145\/1140335"],"URL":"https:\/\/doi.org\/10.1145\/1140335.1140348","relation":{},"subject":[],"published":{"date-parts":[[2006,7,10]]},"assertion":[{"value":"2006-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}