A Framework for Defining Logics

LFCS, Department of Computer Science, University of Edinburgh (1987)
  Copy   BIBTEX

Abstract

"The Logical Framework (LF) is a system for defining a wide class of logics. It is based on a general treatment of syntax, rules, and proofs in terms of a typed [lambda]-calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Löf's system of arities. The treatment of rules and proofs focuses on his notion of a judgement. Logics are encoded in the LF via a new principle, the judgements as types principle, whereby each judgement is identified with the type of its proofs. This allows for a smooth treatment of discharge and variable occurrence conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logic-independent tools such as proof editors and proof checkers can be constructed."

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,667

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-02-03

Downloads
1 (#1,964,073)

6 months
1 (#1,600,438)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?