tag:blogger.com,1999:blog-9757377.post4804670727099223453..comments2008-04-11T12:57:14.787+01:00Philip Wadlerhttp://www.blogger.com/profile/12009347515095774366noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-9757377.post-76250416788337080682008-04-11T12:57:00.000+01:002008-04-11T12:57:00.000+01:00This looks interesting and<BR/>very close to<BR/><BR/>[July 2007] HM(X) Type Inference is CLP(X) Solving<BR/>Martin Sulzmann and Peter J. Stuckey<BR/>To appear in Journal of Functional Programming<BR/>(http://www.itu.dk/people/masu/)<BR/><BR/>Peter and I show that the entire HM(X) type inferencer (including let -polymorphism) can be rephrased in terms of CLP(X) solvingMartinhttp://www.blogger.com/profile/02909988196308862749noreply@blogger.comtag:blogger.com,1999:blog-9757377.post-50166577457988109272008-03-14T16:11:00.000Z2008-03-14T16:11:00.000ZYes, the work will be presented at Computability in Europe 2008 conference.<BR/><BR/>We were aware of the Pottier and Remy work <BR/>but due to strict page limitation of 10 page limit it was very unfortunate that their reference was not cited. They have been cited in our other publications.<BR/><BR/>If you are interested, there's another paper titled "On Desugaring Polymorphic Lets", which has been submitted to TFP'08sunkothttp://www.blogger.com/profile/15510671025140807189noreply@blogger.comtag:blogger.com,1999:blog-9757377.post-61560395154380403202008-03-06T16:43:00.000Z2008-03-06T16:43:00.000ZIs this work published?<BR/><BR/>-- Paulsteckhttp://www.blogger.com/profile/13416750891822431224noreply@blogger.com