Extracting purely functional contents from logical inductive types

Authors:
David Delahaye;Catherine Dubois;Jean-Frédéric Étienne
Affiliations:
CEDRIC/CNAM-ENSIIE, Paris, France;CEDRIC/CNAM-ENSIIE, Paris, France;CEDRIC/CNAM-ENSIIE, Paris, France
Venue:
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Year:
2007

Citing 6
Cited 3

Centaur: the system

SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Constraint-based mode analysis of mercury

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Executing Higher Order Logic

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
A Compiler for Natural Semantics

CC '96 Proceedings of the 6th International Conference on Compiler Construction
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
A new extraction for Coq

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs

Turning Inductive into Equational Specifications

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A DSL for writing type systems for Xtext languages

Proceedings of the 9th International Conference on Principles and Practice of Programming in Java
Producing certified functional code from inductive specifications

CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode consistency analysis, which verifies if a computation is possible w.r.t. the selected inputs/outputs, and the code generation itself. We prove that this extraction is sound w.r.t. the Calculus of Inductive Constructions. Finally, we present some optimizations, as well as the implementation designed in the Coq proof assistant framework.