Compilation as Rewriting in Higher Order Logic

  • Authors:
  • Guodong Li;Konrad Slind

  • Affiliations:
  • School of Computing, University of Utah,;School of Computing, University of Utah,

  • Venue:
  • CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an approach based on the use of deductive rewriting to construct a trusted compiler for a subset of the native functions of higher order logic. Program transformations are specified by equality theorems that characterize the transformations; and the mechanical application of these rules is directed by programs written in the meta-language of the logical framework. Each application of a rule ensures that the transformed code is equivalent to the original one, thus warranting the correctness of the entire compiler.