File: basic_rectype_net.doc

package info (click to toggle)
hol-light 20190729-4
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 42,676 kB
  • sloc: ml: 637,078; cpp: 439; makefile: 301; lisp: 286; java: 279; sh: 239; yacc: 108; perl: 78; ansic: 57; sed: 39; python: 13
file content (22 lines) | stat: -rw-r--r-- 721 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
\DOC basic_rectype_net

\TYPE {basic_rectype_net : (int * (term -> thm)) net ref}

\SYNOPSIS
Net of injectivity and distinctness properties for recursive type constructors.

\DESCRIBE
HOL Light maintains a net of theorems used to simplify equations between
elements of recursive datatypes; essentially these include injectivity and
distinctness, e.g. {CONS_11} and {NOT_CONS_NIL} for lists. This net is used in
some situations where such things need to be proved automatically, notably in
{define}. A call to {basic_rectype_net()} returns that net. It is automatically
updated whenever a type is defined by {define_type}.

\FAILURE
Never fails.

\SEEALSO
cases, define, distinctness, GEN_BETA_CONV, injectivity.

\ENDDOC