Abstract Over the past three decades, a variety of meta-reasoning systems which support reasoning about higher-order abstract specifications have been designed and developed. In this paper, we survey and compare four meta-reasoning sys-tems, Twelf, Beluga, Abella and Hybrid, using several benchmarks from the open repository ORBI that describes challenge problems for reasoning with higher-order abstract syntax representations. In particular, we investigate how these systems mechanize and support reasoning using a context of assumptions. This highlights commonalities and differences in these systems and is a first step towards trans-lating between them
Logical frameworks supporting higher-order abstract syntax (HOAS) allow a direct and concise specifi...
Various meta-languages for the manipulation and specification of programs and programming languages ...
We present a series of improvements to the Hybrid system, a formal theory implemented in Isabelle/HO...
Abstract Over the past three decades, a variety of meta-reasoning systems which support reasoning ab...
Over the past three decades, a variety of meta-reasoning systems which support reasoning about highe...
syntax (HOAS) in representing formal systems. Although these systems seem su-perficially the same, t...
A variety of logical frameworks supports the use of higher order abstract syntax in representing for...
syntax (HOAS) in representing formal systems. Although these systems seem su-perficially the same, t...
We investigate the development of a general-purpose framework for mechanized reasoning about the met...
We investigate the development of a general-purpose framework for mechanized reasoning about the met...
We investigate the development of a general-purpose framework for mechanized reasoning about the met...
AbstractLogical frameworks supporting higher-order abstract syntax (HOAS) allow a direct and concise...
Combining Higher Order Abstract Syntax (HOAS) and (co)induction is well known to be problematic. In ...
Various meta-languages for the manipulation and specification of programs and programming languages ...
AbstractUsing constraint logic techniques, it is made possible to use a well-known metainterpreter b...
Logical frameworks supporting higher-order abstract syntax (HOAS) allow a direct and concise specifi...
Various meta-languages for the manipulation and specification of programs and programming languages ...
We present a series of improvements to the Hybrid system, a formal theory implemented in Isabelle/HO...
Abstract Over the past three decades, a variety of meta-reasoning systems which support reasoning ab...
Over the past three decades, a variety of meta-reasoning systems which support reasoning about highe...
syntax (HOAS) in representing formal systems. Although these systems seem su-perficially the same, t...
A variety of logical frameworks supports the use of higher order abstract syntax in representing for...
syntax (HOAS) in representing formal systems. Although these systems seem su-perficially the same, t...
We investigate the development of a general-purpose framework for mechanized reasoning about the met...
We investigate the development of a general-purpose framework for mechanized reasoning about the met...
We investigate the development of a general-purpose framework for mechanized reasoning about the met...
AbstractLogical frameworks supporting higher-order abstract syntax (HOAS) allow a direct and concise...
Combining Higher Order Abstract Syntax (HOAS) and (co)induction is well known to be problematic. In ...
Various meta-languages for the manipulation and specification of programs and programming languages ...
AbstractUsing constraint logic techniques, it is made possible to use a well-known metainterpreter b...
Logical frameworks supporting higher-order abstract syntax (HOAS) allow a direct and concise specifi...
Various meta-languages for the manipulation and specification of programs and programming languages ...
We present a series of improvements to the Hybrid system, a formal theory implemented in Isabelle/HO...