The Refined Calculus of Inductive Construction: Parametricity and Abstraction
classification
💻 cs.LO
keywords
calculusinductiveparametricityabstractionautomateconstructionconstructionsdefine
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.