src/CTT/ROOT
author paulson <lp15@cam.ac.uk>
Wed, 02 May 2018 23:32:47 +0100
changeset 68069 36209dfb981e
parent 65447 fae6051ec192
child 69272 15e9ed5b28fb
permissions -rw-r--r--
tidying up and using real induction methods

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
    CTT
    "ex/Typechecking"
    "ex/Elimination"
    "ex/Equality"
    "ex/Synthesis"
  document_files
    "root.tex"