The Agda Universal Algebra Library, Part 2: Structure

03/16/2021
by   William DeMeo, et al.
0

The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and proof assistant. The UALib includes a substantial collection of definitions, theorems, and proofs from universal algebra, equational logic, and model theory, and as such provides many examples that exhibit the power of inductive and dependent types for representing and reasoning about mathematical structures and equational theories. In this paper, we describe the the types and proofs of the UALib that concern homomorphisms, terms, and subalgebras.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/09/2021

The Agda Universal Algebra Library, Part 1: Foundation

The Agda Universal Algebra Library (UALib) is a library of types and pro...
01/25/2021

The Agda Universal Algebra Library and Birkhoff's Theorem in Dependent Type Theory

The Agda Universal Algebra Library (UALib) is a library of types and pro...
09/06/2017

On dependent types and intuitionism in programming mathematics

It is discussed a practical possibility of a provable programming of mat...
05/28/2021

A Modular First Formalisation of Combinatorial Design Theory

Combinatorial design theory studies set systems with certain balance and...
10/07/2021

Formalizing Geometric Algebra in Lean

This paper explores formalizing Geometric (or Clifford) algebras into th...
02/09/2022

Reflexive tactics for algebra, revisited

Computational reflection allows us to turn verified decision procedures ...
10/23/2020

An Intuitionistic Set-theoretical Model of Fully Dependent CCω

Werner's set-theoretical model is one of the simplest models of CIC. It ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.