Abstract
Adequacy is an important criterion for judging whether a formalization is suitable for reasoning about the actual object of study. The issue is particularly subtle in the expansive case of approaches to languages with name-binding. In prior work, adequacy has been formalized only with respect to specific representation techniques. In this article, we give a general formal definition based on model-theoretic isomorphisms or interpretations. We investigate and formalize an adequate interpretation of untyped lambda-calculus within a higher-order metalanguage in Isabelle/HOL using the Nominal Datatype Package. Formalization elucidates some subtle issues that have been neglected in informal arguments concerning adequacy.
| Original language | English |
|---|---|
| Pages (from-to) | 209-239 |
| Number of pages | 31 |
| Journal | Journal of Automated Reasoning |
| Volume | 49 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Aug 2012 |
Fingerprint
Dive into the research topics of 'Formalizing adequacy: A case study for higher-order abstract syntax'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver