src/CTT/ROOT
author blanchet
Mon May 19 23:43:53 2014 +0200 (2014-05-19)
changeset 57008 10f68b83b474
parent 51403 2ff3a5589b05
child 58974 cbc2ac19d783
permissions -rw-r--r--
use E 1.8's auto scheduler option
wenzelm@51397
     1
chapter CTT
wenzelm@51397
     2
wenzelm@48738
     3
session CTT = Pure +
wenzelm@48475
     4
  description {*
wenzelm@48475
     5
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@48475
     6
    Copyright   1991  University of Cambridge
wenzelm@51403
     7
wenzelm@51403
     8
    This is a version of Constructive Type Theory (extensional equality,
wenzelm@51403
     9
    no universes).
wenzelm@51403
    10
wenzelm@51403
    11
    Useful references on Constructive Type Theory:
wenzelm@51403
    12
wenzelm@51403
    13
    B. Nordström, K. Petersson and J. M. Smith, Programming in Martin-Löf's
wenzelm@51403
    14
    Type Theory (Oxford University Press, 1990)
wenzelm@51403
    15
wenzelm@51403
    16
    Simon Thompson, Type Theory and Functional Programming (Addison-Wesley,
wenzelm@51403
    17
    1991)
wenzelm@48475
    18
  *}
wenzelm@48483
    19
  options [document = false]
wenzelm@48475
    20
  theories Main
wenzelm@48475
    21
wenzelm@48738
    22
session "CTT-ex" in ex = CTT +
wenzelm@48475
    23
  description {*
wenzelm@48475
    24
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@48475
    25
    Copyright   1991  University of Cambridge
wenzelm@48475
    26
wenzelm@48475
    27
    Examples for Constructive Type Theory.
wenzelm@48475
    28
  *}
wenzelm@48483
    29
  options [document = false]
wenzelm@48475
    30
  theories Typechecking Elimination Equality Synthesis