proper reset of published decorations: initial value is Nil, afterwards it is a list of canonical length and order;
chapter CTT
session CTT = Pure +
description {*
Author: Lawrence C Paulson, Cambridge University Computer Laboratory
Copyright 1991 University of Cambridge
This is a version of Constructive Type Theory (extensional equality,
no universes).
Useful references on Constructive Type Theory:
B. Nordström, K. Petersson and J. M. Smith, Programming in Martin-Löf's
Type Theory (Oxford University Press, 1990)
Simon Thompson, Type Theory and Functional Programming (Addison-Wesley,
1991)
*}
options [thy_output_source]
theories
Main
"ex/Typechecking"
"ex/Elimination"
"ex/Equality"
"ex/Synthesis"
document_files
"root.tex"