Adams, Robin A modular hierarchy of logical frameworks. (English) Zbl 1100.68542 Berardi, Stefano (ed.) et al., Types for proofs and programs. International workshop, TYPES 2003, Torino, Italy, April 30 – May 4, 2003. Revised selected papers. Berlin: Springer (ISBN 3-540-22164-6/pbk). Lecture Notes in Computer Science 3085, 1-16 (2004). Summary: We present a method for defining logical frameworks as a collection of features which are defined and behave independently of one another. Each feature is a set of grammar clauses and rules of deduction such that the result of adding the feature to a framework is a conservative extension of the framework itself. We show how several existing logical frameworks can be so built, and how several much weaker frameworks defined in this manner are adequate for expressing a wide variety of object logics.For the entire collection see [Zbl 1052.68001]. Cited in 1 ReviewCited in 3 Documents MSC: 68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) 03B70 Logic in computer science Software:TinkerType; ALF PDFBibTeX XMLCite \textit{R. Adams}, Lect. Notes Comput. Sci. 3085, 1--16 (2004; Zbl 1100.68542) Full Text: DOI