Information and Computation - Semantics of Data Types
A framework for defining logics
Journal of the ACM (JACM)
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Journal of Automated Reasoning
A Framework for Defining Logical Frameworks
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Computational Logic (TOCL)
LFP: a logical framework with external predicates
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
25 years of formal proof cultures: some problems, some philosophy, bright future
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
| Hi-index | 0.00 |
The Conditional Logical Framework LF K is a variant of the Harper-Honsell-Plotkin's Edinburgh Logical Framemork LF . It features a generalized form of *** -abstraction where β -reductions fire under the condition that the argument satisfies a logical predicate . The key idea is that the type system memorizes under what conditions and where reductions have yet to fire. Different notions of β -reductions corresponding to different predicates can be combined in LF K . The framework LF K subsumes, by simple instantiation, LF (in fact, it is also a subsystem of LF !), as well as a large class of new generalized conditional *** -calculi. These are appropriate to deal smoothly with the side-conditions of both Hilbert and Natural Deduction presentations of Modal Logics. We investigate and characterize the metatheoretical properties of the calculus underpinning LF K , such as subject reduction, confluence, strong normalization.