DeepAI AI Chat
Log In Sign Up

Algebraic models of simple type theories: a polynomial approach

by   Nathanael Arkor, et al.

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed λ-calculi, the computational λ-calculus, and predicate logic. Simple type theories are given models in presheaf categories, with structure specified by algebras of polynomial endofunctors that correspond to natural deduction rules. Initial models, which we construct, abstractly describe the syntax of simple type theories. Taking substitution structure into consideration, we further provide sound and complete semantics in structured cartesian multicategories. This development generalises Lambek's correspondence between the simply-typed λ-calculus and cartesian-closed categories, to arbitrary simple type theories.


page 1

page 2

page 3

page 4


Graded Algebraic Theories

We provide graded extensions of algebraic theories and Lawvere theories ...

Fuzzy Algebraic Theories

In this work we propose a formal system for fuzzy algebraic reasoning. T...

A Variety Theorem for Relational Universal Algebra

We develop an analogue of universal algebra in which generating symbols ...

Structure Formation in Large Theories

Structuring theories is one of the main approaches to reduce the combina...

A type theory for cartesian closed bicategories

We construct an internal language for cartesian closed bicategories. Pre...

Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework

Sesqui-pushout (SqPO) rewriting provides a variant of transformations of...

Revisiting the duality of computation: an algebraic analysis of classical realizability models

In an impressive series of papers, Krivine showed at the edge of the las...