# A logically saturated extension of $\bar{\lambda} \mu \tilde{\mu}$

L.E. Mamane, J.H. Geuvers, J. McKinna

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

## Abstract

This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on ¯¿µ˜µ, a calculus introduced by Curien and Herbelin [5,6]. Just as ¯¿µ˜µ 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.
Original language English Intelligent Computer Mathematics (16th Symposium, Calculemus 2009, 8th International Conference, MKM 2009, Held as Part of CICM 2009, Grand Bend, Canada, July 6-12, 2009. Proceedings) J. Carette, L. Dixon, C. Sacerdoti Coen, S.M. Watt Berlin Springer 405-421 978-3-642-02613-3 https://doi.org/10.1007/978-3-642-02614-0_32 Published - 2009

### Publication series

Name Lecture Notes in Computer Science 5625 0302-9743

## Fingerprint

Dive into the research topics of 'A logically saturated extension of $\bar{\lambda} \mu \tilde{\mu}$'. Together they form a unique fingerprint.