Paper/Paper.thy
changeset 2742 f1192e3474e0
parent 2637 3890483c674f
child 2747 a5da7b6aff8f
equal deleted inserted replaced
2741:651355113eee 2742:f1192e3474e0
  2183   %This completes the proof showing that the weak induction principles imply 
  2183   %This completes the proof showing that the weak induction principles imply 
  2184   %the strong induction principles. 
  2184   %the strong induction principles. 
  2185 *}
  2185 *}
  2186 
  2186 
  2187 
  2187 
  2188 section {* Related Work *}
  2188 section {* Related Work\label{related} *}
  2189 
  2189 
  2190 text {*
  2190 text {*
  2191   To our knowledge the earliest usage of general binders in a theorem prover
  2191   To our knowledge the earliest usage of general binders in a theorem prover
  2192   is described in \cite{NaraschewskiNipkow99} about a formalisation of the
  2192   is described in \cite{NaraschewskiNipkow99} about a formalisation of the
  2193   algorithm W. This formalisation implements binding in type-schemes using a
  2193   algorithm W. This formalisation implements binding in type-schemes using a