A Logically Saturated Extension of ${{\bar\lambda\mu\tilde{\mu}}}$

  • Authors:

  • Lionel Elie Mamane;Herman Geuvers;James Mckinna

  • Affiliations:

  • Institute for Computing and Information Sciences, Radboud University Nijmegen,;Institute for Computing and Information Sciences, Radboud University Nijmegen,;Institute for Computing and Information Sciences, Radboud University Nijmegen,

  • Venue:
  • Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on ${{\bar\lambda\mu\tilde{\mu}}}$, a calculus introduced by Curien and Herbelin. [5,6] Just as ${{\bar\lambda\mu\tilde{\mu}}}$ preserves several proof structures that are identified by the *** -calculus, the proof language presented here aims to preserve as much proof structure as reasonable; we call that property being logically saturated . This leads to several advantages when the language is used as a generic exchange language for proofs, as well as for other uses. We equip the calculus with a simple rendering in pseudo-natural language that aims to give people tools to read, understand and exchange terms of the language. We show how this rendering can, at the cost of some more complexity, be made to produce text that is more natural and idiomatic, or in the style of a declarative proof language like Isar or Mizar.