Deriving Instances with Dependent Types
We present Deriving, a Coq library inspired by the analogous Haskell feature that simplifies the definition of class instances for inductive types. A few declarations suffice to define equality tests for a type or enumerate its elements, and proofs of correctness are provided automatically. The library includes generic implementations of basic classes of the MathComp hierarchy (eqType, choiceType, countType and finType), and can be extended to other classes with user-level code.
I am currently a post-doc researcher at CMU working with Matt Fredrikson and Anupam Datta. I completed my Ph.D. studies at the University of Pennsylvania, under the supervision of Benjamin Pierce.
Sat 25 Jan Times are displayed in time zone: Saskatchewan, Central America change
|10:30 - 11:00|
|Deriving Instances with Dependent Types|
Arthur Azevedo de AmorimCarnegie Mellon University, USAFile Attached
|11:00 - 11:30|
|The use of Coq for Common Criteria Evaluations|
|11:30 - 12:00|
|Verifying concurrent Go code in Coq with Goose|
Tej ChajedMassachusetts Institute of Technology, USA, Joseph TassarottiBoston College, M. Frans KaashoekMassachusetts Institute of Technology, USA, Nickolai ZeldovichMassachusetts Institute of Technology, USALink to publication File Attached
|12:00 - 12:30|
|A Tutorial on Equations|
Matthieu SozeauInriaMedia Attached File Attached