Quantification in tail-recursive function definitions

  • Authors:
  • Sandip Ray

  • Affiliations:
  • The University of Texas at Austin, Austin, TX

  • Venue:
  • ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended tail-recursive equations, that can be uniformly introduced in the logic. We point out some potential benefits of this axiomatization, and discuss the logical impediments behind introducing more general quantified formulas.