The Refined Calculus of Inductive Construction: Parametricity and   Abstraction
  We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq. 
Chantal Keller (INRIA Saclay - Ile de France, LIX), Marc Lasson (LIP)
cs.LO