Lexical selection, coercion, and record types
Résumé
This paper introduces a simply-typed λ-calculus dedicated to the treatment of the lexical phenomena of restrictive selection and type co- ercion. This calculus features records and record types, subtyping through explicit coercion, and bounded polymorphism. We show that coercion infer- ence is decidable and discuss the canonicity of the inferred solutions.