avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
chapter LCF
session LCF = Pure +
description {*
Author: Tobias Nipkow
Copyright 1992 University of Cambridge
Logic for Computable Functions.
Useful references on LCF: Lawrence C. Paulson,
Logic and Computation: Interactive proof with Cambridge LCF (CUP, 1987)
*}
options [document = false]
theories LCF
session "LCF-ex" in ex = LCF +
description {*
Author: Tobias Nipkow
Copyright 1991 University of Cambridge
Some examples from Lawrence Paulson's book Logic and Computation.
*}
options [document = false]
theories
Ex1
Ex2
Ex3
Ex4