Extracting Purely Functional Contents from Logical Inductive Types

@inproceedings{Delahaye2007ExtractingPF,
  title={Extracting Purely Functional Contents from Logical Inductive Types},
  author={D. Delahaye and Catherine Dubois and Jean-Fr{\'e}d{\'e}ric {\'E}tienne},
  booktitle={TPHOLs},
  year={2007}
}
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… Expand
Producing Certified Functional Code from Inductive Specifications
Turning Inductive into Equational Specifications
Generating good generators for inductive relations
A List-machine Benchmark for Mechanized Metatheory: (Extended Abstract)
Mechanized Semantics for the Clight Subset of the C Language
A List-Machine Benchmark for Mechanized Metatheory
Random Testing for Language Design
QuickChick: Property-based testing for Coq
A DSL for writing type systems for Xtext languages
...
1
2
...

References

SHOWING 1-10 OF 13 REFERENCES
Executing Higher Order Logic
A Compiler for Natural Semantics
A New Extraction for Coq
Integrating Natural Semantics and Attribute Grammars : the Minotaur System
Constraint-based mode analysis of mercury
Executable structural operational semantics in Maude
Curry-Style Types for Nominal Terms
Input/Output Dependencies of Normal Logic Programs
  • R. Stärk
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 1994
Centaur: the system
...
1
2
...