Beluga: A framework for programming and reasoning with deductive systems (system description)
Beluga is an environment for programming and reasoning about formal systems given by
axioms and inference rules. It implements the logical framework LF for specifying and …
axioms and inference rules. It implements the logical framework LF for specifying and …
Hybrid: A definitional two-level approach to reasoning with higher-order abstract syntax
Combining higher-order abstract syntax and (co)-induction in a logical framework is well
known to be problematic. We describe the theory and the practice of a tool called Hybrid …
known to be problematic. We describe the theory and the practice of a tool called Hybrid …
The next 700 challenge problems for reasoning with higher-order abstract syntax representations: Part 2—a survey
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 …
about higher-order abstract specifications have been designed and developed. In this …
[PDF][PDF] LNgen: Tool support for locally nameless representations
B Aydemir, S Weirich - Draft available at http://www. cis. upenn. edu …, 2010 - seas.upenn.edu
Given the complexity of the metatheoretic reasoning about current programming languages
and their type systems, techniques for mechanical formalization and checking of such …
and their type systems, techniques for mechanical formalization and checking of such …
A universe of binding and computation
We construct a logical framework supporting datatypes that mix binding and computation,
implemented as a universe in the dependently typed programming language Agda 2. We …
implemented as a universe in the dependently typed programming language Agda 2. We …
Needle & Knot: Binder boilerplate tied up
To lighten the burden of programming language mechanization, many approaches have
been developed that tackle the substantial boilerplate which arises from variable binders …
been developed that tackle the substantial boilerplate which arises from variable binders …
Semi-Automation of Meta-Theoretic Proofs in Beluga
J Schwartzentruber, B Pientka - arxiv preprint arxiv:2311.10439, 2023 - arxiv.org
We present a sound and complete focusing calculus for the core of the logic behind the
proof assistant Beluga as well as an overview of its implementation as a tactic in Beluga's …
proof assistant Beluga as well as an overview of its implementation as a tactic in Beluga's …
Focusing on binding and computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical
systems. In this paper, we define a programming language that provides intrinsic support for …
systems. In this paper, we define a programming language that provides intrinsic support for …
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 …
representing formal systems. Although these systems seem superficially the same, they …
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
This paper presents GM eta: a generic framework for first-order representations of variable
binding that provides once and for all many of the so-called infrastructure lemmas and …
binding that provides once and for all many of the so-called infrastructure lemmas and …