https://wiki.hh.se/ceres/index.php?action=history&feed=atom&title=Publications%3AML-like_Inference_for_ClassifiersPublications:ML-like Inference for Classifiers - Revision history2026-05-22T19:24:20ZRevision history for this page on the wikiMediaWiki 1.22.6https://wiki.hh.se/ceres/index.php?title=Publications:ML-like_Inference_for_Classifiers&diff=4260&oldid=prevSlawek: Created page with "<div style='display: none'> == Do not edit this section == </div> {{PublicationSetupTemplate|Author=Cristiano Calcagno, Eugenio Moggi, Walid Taha |PID=588275 |Name=Calcagno, C..."2014-06-26T03:44:47Z<p>Created page with "<div style='display: none'> == Do not edit this section == </div> {{PublicationSetupTemplate|Author=Cristiano Calcagno, Eugenio Moggi, Walid Taha |PID=588275 |Name=Calcagno, C..."</p>
<p><b>New page</b></p><div><div style='display: none'><br />
== Do not edit this section ==<br />
</div><br />
{{PublicationSetupTemplate|Author=Cristiano Calcagno, Eugenio Moggi, Walid Taha<br />
|PID=588275<br />
|Name=Calcagno, Cristiano (Imperial College, London, UK);Moggi, Eugenio (DISI, Univ. of Genova, Italy);Taha, Walid [waltah] (Rice University, TX, USA)<br />
|Title=ML-like Inference for Classifiers<br />
|PublicationType=Conference Paper<br />
|ContentType=Refereegranskat<br />
|Language=eng<br />
|Journal=<br />
|JournalISSN=<br />
|Status=<br />
|Volume=<br />
|Issue=<br />
|HostPublication=<br />
|Conference=ESOP'04. European Symposium on Programming<br />
|StartPage=<br />
|EndPage=<br />
|Year=2004<br />
|Edition=<br />
|Pages=<br />
|City=<br />
|Publisher=<br />
|Series=<br />
|SeriesISSN=<br />
|ISBN=<br />
|Urls=<br />
|ISRN=<br />
|DOI=<br />
|ISI=<br />
|PMID=<br />
|ScopusId=<br />
|NBN=urn:nbn:se:hh:diva-20976<br />
|LocalId=<br />
|ArchiveNumber=<br />
|Keywords=<br />
|Categories=Datorsystem (20206)<br />
|ResearchSubjects=<br />
|Projects=<br />
|Notes=<br />
|Abstract=<p>Environment classifiers were proposed as a new approach totyping multi-stage languages. Safety was established in the simply-typedand let-polymorphic settings. While the motivation for classifiers was thefeasibility of inference, this was in fact not established. This paper startswith the observation that inference for the full classifier-based systemfails. We then identify a subset of the original system for which inferenceis possible. This subset, which uses implicit classifiers, retains significantexpressivity (e.g. it can embed the calculi of Davies and Pfenning) andeliminates the need for classifier names in terms. Implicit classifiers wereimplemented in MetaOCaml, and no changes were needed to make anexisting test suite acceptable by the new type checker.</p><br />
|Opponents=<br />
|Supervisors=<br />
|Examiners=<br />
|Patent=<br />
|ThesisLevel=<br />
|Credits=<br />
|Programme=<br />
|Subject=<br />
|Uppsok=<br />
|DefencePlace=<br />
|DefenceLanguage=<br />
|DefenceDate=<br />
|CreatedDate=2013-01-14<br />
|PublicationDate=2013-01-15<br />
|LastUpdated=2014-03-19<br />
|diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:588275}}<br />
<div style='display: none'><br />
<br />
== Keep all hand-made modifications below ==<br />
</div>{{PublicationDisplayTemplate}}</div>Slawek