Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Adapting Proofs-as-Programs: The Curry-Howard Protocol (Monographs in Computer Science)
Adapting Proofs-as-Programs: The Curry-Howard Protocol (Monographs in Computer Science)
EDOC '07 Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference
Proofs-as-Model-Transformations
ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
An algebraic semantics for MOF
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
A type theoretic framework for formal metamodelling
Proceedings of the 2004 international conference on Architecting Systems with Trustworthy Components
Comparing verification techniques for model transformations
Proceedings of the Workshop on Model-Driven Engineering, Verification and Validation
A rewriting logic approach to the formal specification and verification of web applications
Science of Computer Programming
Embedding domain-specific modelling languages in Maude specifications
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
This paper sketches an approach to the synthesis of provably correct model transformations within the Coq theorem prover, an implementation of Coquand and Huet's Calculus of Inductive Constructions. It extends work done by Poernomo on proofs-as-model-transformations in the related formalism of Martin-Löf predicative Constructive Type Theory. We show how the impredicative theory of Coq, together with its treatment of coinductive types, lends itself to the synthesis of a wider range of model transformations than Poernomo had treated before. We illustrate the practical benefits and potential scalability of our approach by means of a case study taken from industry.