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 proceeding › Conference 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 language | English |
|---|---|
| Title of host publication | Types for Proofs and Programs |
| Editors | Stefano Berardi, Mario Coppo, Ferruccio Damiani |
| Publisher | Springer |
| Pages | 1-16 |
| Number of pages | 16 |
| Volume | 3085 |
| ISBN (Print) | 3-540-22164-6 |
| DOIs | |
| Publication status | Published - 2004 |
| Event | TYPES 2003 - Torino, Italy Duration: 30 Apr 2003 → 4 May 2003 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| ISSN (Print) | 0302-9743 |
Conference
| Conference | TYPES 2003 |
|---|---|
| Country | Italy |
| City | Torino |
| Period | 30/04/03 → 4/05/03 |
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.
ID: 398954