Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I

Authors:
Claudio Sacerdoti Coen
Affiliations:
Department of Computer Science, University of Bologna, Bologna, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 5
Cited 0

Type checking with universes

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
The duality of computation

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Codifying Guarded Definitions with Recursive Schemes

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
From Proof-Assistants to Distributed Libraries of Mathematics: Tips and Pitfalls

MKM '03 Proceedings of the Second International Conference on Mathematical Knowledge Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare several reduction and conversion strategies for the Calculus of (co)Inductive Constructions by running benchmarks from the library of the Coq proof assistant. All the strategies have been implemented in an independent verifier for the proof objects of Coq that is part of the Matita proof assistant.