Log In Sign Up

Abstract clones for abstract syntax

by   Nathanael Arkor, et al.

We give a formal treatment of simple type theories, such as the simply-typed λ-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional algebraic structure, one can further axiomatize second-order, variable-binding operators. This provides a syntax-independent representation of simple type theories. We describe multisorted second-order presentations, such as the presentation of the simply-typed λ-calculus, and their clone-theoretic algebras; free algebras on clones abstractly describe the syntax of simple type theories quotiented by equations such as β- and η-equality. We give a construction of free algebras and derive a corresponding induction principle, which facilitates syntax-independent proofs of properties such as adequacy and normalization for simple type theories. Working only with clones avoids some of the complexities inherent in presheaf-based frameworks for abstract syntax.


page 1

page 5

page 9

page 11

page 13

page 15

page 17

page 18


Algebraic models of simple type theories: a polynomial approach

We develop algebraic models of simple type theories, laying out a framew...

Formal Metatheory of Second-Order Abstract Syntax

Despite extensive research both on the theoretical and practical fronts,...

Rensets and Renaming-Based Recursion for Syntax with Bindings

I introduce renaming-enriched sets (rensets for short), which are algebr...

Abstract Representation of Binders in OCaml using the Bindlib Library

The Bindlib library for OCaml provides a set of tools for the manipulati...

Induction principles for type theories, internally to presheaf categories

We present new induction principles for the syntax of dependent type the...

SeCaV: A Sequent Calculus Verifier in Isabelle/HOL

We describe SeCaV, a sequent calculus verifier for first-order logic in ...

A second-order Magnus-type integrator for evolution equations with delay

We rewrite abstract delay equations to nonautonomous abstract Cauchy pro...