{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:59Z","timestamp":1750307999380,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"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.1140347","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"85-96","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Polymorphic algebraic data type reconstruction"],"prefix":"10.1145","author":[{"given":"Tom","family":"Schrijvers","sequence":"first","affiliation":[{"name":"Katholieke Universiteit Leuven, Heverlee, Belgium"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[{"name":"Katholieke Universiteit Leuven, Heverlee, Belgium"}]}],"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\/11547662_5"},{"key":"e_1_3_2_1_2_1","volume-title":"The Haskell' Website","author":"The Haskell' Committee","year":"2006","unstructured":"The Haskell' Committee . The Haskell' Website , 2006 . http:\/\/hackage.haskell.org\/trac\/haskell-prime. The Haskell' Committee. The Haskell' Website, 2006. http:\/\/hackage.haskell.org\/trac\/haskell-prime."},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"Proceedings of Australian Workshop on Constraints","author":"Demoen Bart","year":"1998","unstructured":"Bart Demoen , Maria Garc\u00eda de la Banda, and Peter J. Stuckey. Type constraint solving for parametric and ad-hoc polymorphism. In M. Maher, editor , Proceedings of Australian Workshop on Constraints , pages 1 -- 12 , 1998 . Bart Demoen, Maria Garc\u00eda de la Banda, and Peter J. Stuckey. Type constraint solving for parametric and ad-hoc polymorphism. In M. Maher, editor, Proceedings of Australian Workshop on Constraints, pages 1--12, 1998."},{"key":"e_1_3_2_1_4_1","volume-title":"Standard ML with polymorphic recursion","author":"Emms Martin","year":"1998","unstructured":"Martin Emms and Hans Lei\u03b2 . Standard ML with polymorphic recursion , 1998 . http:\/\/www.cis.uni-muenchen.de\/projects\/polyrec.html. Martin Emms and Hans Lei\u03b2. Standard ML with polymorphic recursion, 1998. http:\/\/www.cis.uni-muenchen.de\/projects\/polyrec.html."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113468"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1991.151654"},{"key":"e_1_3_2_1_8_1","first-page":"599","volume-title":"ICLP'94","author":"Gallagher John P.","year":"1994","unstructured":"John P. Gallagher and D. Andre de Waal. Fast and precise regular approximation of logic programs. In Logic Programming , ICLP'94 , pages 599 -- 561 , 1994 . John P. Gallagher and D. Andre de Waal. Fast and precise regular approximation of logic programs. In Logic Programming, ICLP'94, pages 599--61, 1994."},{"key":"e_1_3_2_1_9_1","volume-title":"ML Workshop","author":"Garrigue J.","year":"1998","unstructured":"J. Garrigue . Programming with polymorphic variants . In ML Workshop , Baltimore, USA , September 1998 . J. Garrigue. Programming with polymorphic variants. In ML Workshop, Baltimore, USA, September 1998."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263710"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/169701.169692"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90032-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100279"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/169701.169687"},{"key":"e_1_3_2_1_15_1","first-page":"254","volume-title":"ICLP 2003","volume":"2916","author":"Lagoon Vitaly","year":"2003","unstructured":"Vitaly Lagoon , Fr\u00e9d\u00e9ric Mesnard , and Peter J. Stuckey . Termination analysis with types is more accurate. In Logic Programming , ICLP 2003 , volume 2916 of LNCS, pages 254 -- 268 , 2003 . Vitaly Lagoon, Fr\u00e9d\u00e9ric Mesnard, and Peter J. Stuckey. Termination analysis with types is more accurate. In Logic Programming, ICLP 2003, volume 2916 of LNCS, pages 254--268, 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088361.1088366"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258962"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_3_2_1_19_1","first-page":"289","volume-title":"ISLP 1984","author":"Mishra Prateek","year":"1984","unstructured":"Prateek Mishra . Towards a theory of types in Prolog. In Logic Programming , ISLP 1984 , pages 289 -- 298 , 1984 . Prateek Mishra. Towards a theory of types in Prolog. In Logic Programming, ISLP 1984, pages 289--298, 1984."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/647326.721798"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/940880.940888"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/280586"},{"key":"e_1_3_2_1_23_1","volume-title":"Functional Programming and Parallel Graph Rewriting","author":"Plasmeijer Rinus","year":"1993","unstructured":"Rinus Plasmeijer and Marko~Van Eekelen . Functional Programming and Parallel Graph Rewriting . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 1993 . Rinus Plasmeijer and Marko~Van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1993."},{"key":"e_1_3_2_1_24_1","first-page":"1 2005","volume-title":"Proceedings of the 17th International Workshop on Implementation and Application of Functional Languages","author":"Schrijvers Tom","year":"2005","unstructured":"Tom Schrijvers and Maurice Bruynooghe . Towards constraint-based type inference with polymorphic recursion for functional and logic languages. In A. Butterfield, editor , Proceedings of the 17th International Workshop on Implementation and Application of Functional Languages , pages 1 -- 16 , 2005 . Department of Computer Science, Trinity College Dublin Technical Report No : TCD-CS- 2005 - 2060 . Tom Schrijvers and Maurice Bruynooghe. Towards constraint-based type inference with polymorphic recursion for functional and logic languages. In A. Butterfield, editor, Proceedings of the 17th International Workshop on Implementation and Application of Functional Languages, pages 1--16, 2005. Department of Computer Science, Trinity College Dublin Technical Report No: TCD-CS-2005-60."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207123"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00068-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108970.1108974"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/249069.231414"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)00021-W"},{"key":"e_1_3_2_1_30_1","volume-title":"SWI-Prolog release 5.4.0","author":"Wielemaker Jan","year":"2004","unstructured":"Jan Wielemaker . SWI-Prolog release 5.4.0 , 2004 . http:\/\/www.swi-prolog.org\/. Jan Wielemaker. SWI-Prolog release 5.4.0, 2004. http:\/\/www.swi-prolog.org\/."},{"key":"e_1_3_2_1_31_1","first-page":"817","volume-title":"ICLP 1987","author":"Zobel Justin","year":"1987","unstructured":"Justin Zobel . Derivation of polymorphic types for Prolog programs. In Logic Programming , ICLP 1987 , pages 817 -- 838 , 1987 . Justin Zobel. Derivation of polymorphic types for Prolog programs. In Logic Programming, ICLP 1987, pages 817--838, 1987."}],"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.1140347","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1140335.1140347","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.1140347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,10]]},"references-count":31,"alternative-id":["10.1145\/1140335.1140347","10.1145\/1140335"],"URL":"https:\/\/doi.org\/10.1145\/1140335.1140347","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"}}]}}