2000 character limit reached
The Refined Calculus of Inductive Construction: Parametricity and Abstraction
Published 27 Nov 2012 in cs.LO | (1211.6341v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.