Skip to main content
    • Aa
    • Aa

Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions


A variety of logical frameworks supports the use of higher order abstract syntax in representing formal systems. Although these systems seem superficially the same, they differ in a variety of ways, for example, how they handle a context of assumptions and which theorems about a given formal system can be concisely expressed and proved. Our contributions in this paper are two-fold: (1) We develop a common infrastructure and language for describing benchmarks for systems supporting reasoning with binders, and (2) we present several concrete benchmarks, which highlight a variety of different aspects of reasoning within a context of assumptions. Our work provides the background for the qualitative comparison of different systems that we have completed in a separate paper. It also allows us to outline future fundamental research questions regarding the design and implementation of meta-reasoning systems.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

A. Felty , A. Momigliano and B. Pientka (2015a). The next 700 challenge problems for reasoning with higher-order abstract syntax representations: Part 2—a survey. Journal of Automated Reasoning 55 (4) 307372.

A.P. Felty and A. Momigliano (2012). Hybrid: A definitional two-level approach to reasoning with higher-order abstract syntax. Journal of Automated Reasoning 48 (1) 43105.

M. Fernández and C. Urban (2012). Preface: Theory and applications of abstraction, substitution and naming. Journal of Automated Reasoning 49 (2) 111114.

A. Gacek , D. Miller and G. Nadathur (2012). A two-level logic approach to reasoning about computations. Journal of Automated Reasoning 49 (2) 241273.

R. Harper and D.R. Licata (2007). Mechanizing metatheory in a logical framework. Journal of Functional Programming 17 (4–5) 613673.

D. Miller (1991). A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation 1 (4) 497536.

D. Miller and C. Palamidessi (1999). Foundational aspects of syntax. ACM Computing Surveys 31 (3es) 16. Article No. 11.

B.C. Pierce and S. Weirich (2012). Preface to special issue: The poplmark challenge. Journal of Automated Reasoning 49 (3) 301302.

G. Sutcliffe (2009). The TPTP problem library and associated infrastructure. Journal of Automated Reasoning 43 (4) 337362.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 9 *
Loading metrics...

Abstract views

Total abstract views: 67 *
Loading metrics...

* Views captured on Cambridge Core between 5th May 2017 - 18th August 2017. This data will be updated every 24 hours.