ML-Like Inference for Classifiers

Environment classifiers were proposed as a new approach to typing multi-stage languages. Safety was established in the simply-typed and let-polymorphic settings. While the motivation for classifiers was the feasibility of inference, this was in fact not established. This paper starts with the observation that inference for the full classifier-based system fails. We then identify a subset of the original system for which inference is possible. This subset, which uses implicit classifiers, retains significant expressivity (e.g. it can embed the calculi of Davies and Pfenning) and eliminates the need for classifier names in terms. Implicit classifiers were implemented in MetaOCaml, and no changes were needed to make an existing test suite acceptable by the new type checker.

• Type: Conference
• Year: 2004
• Where: ESOP
• Authors: Cristiano Calcagno, Eugenio Moggi, Walid Taha
• Keywords: Environment Classifiers, ESOP 2004, Implicit Classifiers, Multi-stage Languages, Programming Languages