Formalized metatheory with terms represented by an indexed family of types
Paper i proceeding, 2006

It is possible to represent the terms of a syntax with binding constructors by a family of types, indexed by the free variables that may occur. This approach has been used several times for the study of syntax and substitution, but never for the formalization of the metatheory of a typing system. We describe a recent formalization of the metatheory of Pure Type Systems in Coq as an example of such a formalization. In general, careful thought is required as to how each definition and theorem should be stated, usually in an unfamiliar ‘big-step’ form; but, once the correct form has been found, the proofs are very elegant and direct.

syntax with binding

type theory

formalisation of mathematics

Författare

Robin Adams

Chalmers, Data- och informationsteknik, Datavetenskap

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 3839 1-16

Types for Proofs and Programs International Workshop, TYPES 2004
Jouy-en-Josas, France,

Ämneskategorier

Algebra och logik

Datavetenskap (datalogi)

Styrkeområden

Informations- och kommunikationsteknik

Fundament

Grundläggande vetenskaper

DOI

10.1007/11617990_1

Mer information

Skapat

2018-08-23