16 papers:
PLDI-2015-SiekTW- Blame and coercion: together again for the first time (JGS, PT, PW), pp. 425–435.
ICFP-2014-BreitnerEJW #haskell #low cost- Safe zero-cost coercions for Haskell (JB, RAE, SLPJ, SW), pp. 189–202.
LICS-CSL-2014-CretinR #constraints #system f- System F with coercion constraints (JC, DR), p. 10.
FM-2012-HeatherS #framework #modelling- A Formal Framework for Modelling Coercion Resistance and Receipt Freeness (JH, SS), pp. 217–231.
POPL-2012-CretinR #abstraction #on the #power of- On the power of coercion abstraction (JC, DR), pp. 361–372.
SAC-OOPS-J-2008-HallettLRS10 #multi #type system- Integrating coercion with subtyping and multiple dispatch (JJH, VL, SR, GLSJ), pp. 787–795.
ICFP-2009-SwamyHB #formal method- A theory of typed coercions and its applications (NS, MWH, GMB), pp. 329–340.
SAC-2008-HallettLRS #multi #type system- Integrating coercion with subtyping and multiple dispatch (JJH, VL, SR, GLSJ), pp. 166–170.
SAS-2002-Faxen #analysis #representation- Representation Analysis for Coercion Placement (KFF), pp. 278–293.
PPDP-2002-Shafarenko #morphism #type inference #type system- Coercion as homomorphism: type inference in a system with subtyping and overloading (AVS), pp. 14–25.
SAC-1994-StansiferW #morphism #polymorphism #re-engineering- Type reconstruction for coercion polymorphism (RS, DW), pp. 420–424.
LFP-1990-TannenGS- Computing with Coercions (VT, CAG, AS), pp. 44–60.
FPCA-1989-WandO #complexity #on the #type inference- On the Complexity of Type Inference with Coercion (MW, PO), pp. 293–298.
LICS-1989-Breazu-TannenCGS #inheritance- Inheritance and Explicit Coercion (Preliminary Report) (VT, TC, CAG, AS), pp. 112–129.
PLDI-1987-SutorJ #interpreter #type inference- The type inference and coercion facilities in the scratchpad II interpreter (RSS, RDJ), pp. 56–63.
POPL-1984-Mitchell #type inference- Coercion and Type Inference (JCM), pp. 175–185.