Abstract
We present a system called Adelfa that provides mechanized support for reasoning about specifications developed in the Edinburgh Logical Framework or LF. Underlying Adelfa is a new logic named LLF. Typing judgements in LF are represented by atomic formulas in LLF and quantification is permitted over contexts and terms that appear in such formulas. Contexts, which constitute type assignments to uniquely named variables that are modelled using the technical device of nominal constants, are characterized in LLF by context schemas that describe their inductive structure. We present these formulas and an associated semantics before sketching a proof system for constructing arguments that are sound with respect to the semantics. We then outline the realization of this proof system in Adelfa and illustrate its use through a few example proof developments. We conclude the paper by relating Adelfa to existing systems for reasoning about LF specifications.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 104-120 |
| Number of pages | 17 |
| Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| Volume | 337 |
| DOIs | |
| State | Published - Jul 16 2021 |
| Event | 16th Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP 2021 - Pittsburgh, United States Duration: Jul 16 2021 → … |
Bibliographical note
Publisher Copyright:© 2021 M. Southern & G. Nadathur.