Search: onr:"swepub:oai:research.chalmers.se:af4e16c3-abc8-4974-9bff-ec3aa56e8553" >
Formalized metatheo...
Formalized metatheory with terms represented by an indexed family of types
-
- Adams, Robin, 1978 (author)
- Royal Holloway University of London
-
(creator_code:org_t)
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2006
- 2006
- English.
-
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. ; 3839, s. 1-16
- Related links:
-
https://research.cha... (primary) (free)
-
show more...
-
https://research.cha...
-
https://research.cha...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Matematik -- Algebra och logik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Algebra and Logic (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Keyword
- type theory
- syntax with binding
- formalisation of mathematics
Publication and Content Type
- kon (subject category)
- ref (subject category)
Find in a library
To the university's database