Author:
Harper Robert,Honsell Furio,Plotkin Gordon
Abstract
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed λ-calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Lo¨f's system of arities. The treatment of rules and proofs focuses on his notion of a
judgment
. Logics are represented in LF via a new principle, the
judgments as types
principle, whereby each judgment is identified with the type of its proofs. This allows for a smooth treatment of discharge and variable occurence conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgments 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference47 articles.
1. Resolution in type theory;~ANDREWS P.B;J. Symb. Logic,1971
2. Simple consequence relations
3. ~AVRON A. HONSELL F. MASON L A AND POLLACK R. Using typed lambda calculus to ~implement formal systems on a machine. J. Automated Reas. to appear.]] 10.1007/BF00245294 ~AVRON A. HONSELL F. MASON L A AND POLLACK R. Using typed lambda calculus to ~implement formal systems on a machine. J. Automated Reas. to appear.]] 10.1007/BF00245294
4. ~BURSTALL R. AND HONSELL F. Operational semantics in a natural deduction setting. In ~Logical Frameworks G. Huet and G. Plotkin Eds. Cambridge Umversity Press Cambridge ~Mass. 1991 pp. 185 213.]] ~BURSTALL R. AND HONSELL F. Operational semantics in a natural deduction setting. In ~Logical Frameworks G. Huet and G. Plotkin Eds. Cambridge Umversity Press Cambridge ~Mass. 1991 pp. 185 213.]]
Cited by
541 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation;Proceedings of the ACM on Programming Languages;2024-01-05
2. Semi-Automation of Meta-Theoretic Proofs in Beluga;Electronic Proceedings in Theoretical Computer Science;2023-11-17
3. Contextual Refinement Types;Electronic Proceedings in Theoretical Computer Science;2023-11-17
4. Finitary Type Theories With and Without Contexts;Journal of Automated Reasoning;2023-10-07
5. A Calculus of Inductive Linear Constructions;Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development;2023-08-30