LFP – A Logical Framework with External Predicates (Announcement and survey)

Invited Talk: A peer-refereed Festschrift will be published as a special issue of the JLC journal.International audienceThroughout the history of Mathematics, several different proof cul- tures have co-existed, and still do co-exist. After 25 years of Logical Frameworks, we can say that even as far as proof metalanguages go, a definitive system is utopian and that we are witnessing the continuous development of a diversity of formal proof cultures, see e.g. [10-12, 17, 19, 21, 23, 24, 28]. In this paper, we propose a contribution towards the clarification of some controversial issues that have arisen in the theory and practice of Logical Frameworks, and have possibly motivated such a manifold speciation. Using as a running example the encoding of the critical features of Non-Commutative Linear Logic (NCLL) [26] in the Logical Framework LFP [20], we discuss the notions of adequacy of an encoding, locality of a side-condition, deep and shallow encodings, and how to embed heterogenous justifications or external evidence in LF. This discussion naturally leads to the question of how to express formally the expressive power of a Logical Framework, a minimal requirement being that of encoding itself within itself. We focus on LFP and we discuss its relations to the original LF[17], and briefly to the Conditional LF [21], and the Pattern LF [19] previously introduced by the authors. We conclude the paper by briefly comparing LFP to λΠ-calculus modulo [12], the Linear LF [9], and the Concurrent LF[28]