Turning Inductive into Equational Specifications

Authors:
Stefan Berghofer;Lukas Bulwahn;Florian Haftmann
Affiliations:
Institut für Informatik, Technische Universitüt München, Garching, Germany 85748;Institut für Informatik, Technische Universitüt München, Garching, Germany 85748;Institut für Informatik, Technische Universitüt München, Garching, Germany 85748
Venue:
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Year:
2009

Citing 5
Cited 7

A unified computation model for functional and logic programming

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Executing Higher Order Logic

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
An operational semantics and type safety prooffor multiple inheritance in C++

Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
A mechanized model of the theory of objects

FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Extracting purely functional contents from logical inductive types

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics

Animating the formalised semantics of a Java-like language

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Code generation via higher-order rewrite systems

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Teaching semantics with a proof assistant: no more LSD trip proofs

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Smart testing of functional programs in isabelle

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
An executable semantics for compcert c

CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Producing certified functional code from inductive specifications

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

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inductively defined predicates are frequently used in formal specifications. Using the theorem prover Isabelle , we describe an approach to turn a class of systems of inductively defined predicates into a system of equations using data flow analysis; the translation is carried out inside the logic and resulting equations can be turned into functional program code in SML , OCaml or Haskell using the existing code generator of Isabelle . Thus we extend the scope of code generation in Isabelle from functional to functional-logic programs while leaving the trusted foundations of code generation itself intact.