A Modular Hierarchy of Logical Frameworks. / Adams, Robin.

Types for Proofs and Programs. ed. / Stefano Berardi; Mario Coppo; Ferruccio Damiani. Vol. 3085 Springer, 2004. p. 1-16 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Documents

  • Modhier

    Submitted manuscript, 57 KB, application/x-dvi

Abstract

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.
Original languageEnglish
Title of host publicationTypes for Proofs and Programs
EditorsStefano Berardi, Mario Coppo, Ferruccio Damiani
PublisherSpringer
Pages1-16
Number of pages16
Volume3085
ISBN (Print)3-540-22164-6
DOIs
Publication statusPublished - 2004
EventTYPES 2003 - Torino, Italy
Duration: 30 Apr 20034 May 2003

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
ISSN (Print)0302-9743

Conference

ConferenceTYPES 2003
CountryItaly
CityTorino
Period30/04/034/05/03
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 398954