Characteristics of de Bruijn's early proof checker Automath

03/02/2022
by   Herman Geuvers, et al.
0

The `mathematical language' Automath, conceived by N.G. de Bruijn in 1968, was the first theorem prover actually working and was used for checking many specimina of mathematical content. Its goals and syntactic ideas inspired Th. Coquand and G. Huet to develop the calculus of constructions, CC, which was one of the first widely used interactive theorem provers and forms the basis for the widely used Coq system. The original syntax of Automath is not easy to grasp. Yet, it is essentially based on a derivation system that is similar to the Calculus of Constructions (`CC'). The relation between the Automath syntax and CC has not yet been sufficiently described, although there are many references in the type theory community to Automath. In this paper we focus on the backgrounds and on some uncommon aspects of the syntax of Automath. We expose the fundamental aspects of a `generic' Automath system, encapsulating the most common versions of Automath. We present this generic Automath system in a modern syntactic frame. The obtained system makes use of λD, a direct extension of CC with definitions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2018

Syntax and Semantics of Cedille

This document presents the syntax, classification rules, realizability s...
research
07/05/2018

Formalization in Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using Multiple Substitution

We present a full formalization in Martin-Löf's Constructive Type Theory...
research
07/24/2021

Case Studies in Formal Reasoning About Lambda-Calculus: Semantics, Church-Rosser, Standardization and HOAS

We have previously published the Isabelle/HOL formalization of a general...
research
02/17/2021

Formalizing relations in type theory

Type theory plays an important role in foundations of mathematics as a f...
research
07/17/2019

Shallow Embedding of Type Theory is Morally Correct

There are multiple ways to formalise the metatheory of type theory. For ...
research
10/01/2017

Mathematical foundations of matrix syntax

Matrix syntax is a formal model of syntactic relations in language. The ...
research
11/20/2020

Gradualizing the Calculus of Inductive Constructions

Acknowledging the ordeal of a fully formal development in a proof assist...

Please sign up or login with your details

Forgot password? Click here to reset