File: define_set_abstraction_syntax.doc

package info (click to toggle)
hol88 2.02.19940316dfsg-5
  • links: PTS
  • area: main
  • in suites: bookworm
  • size: 65,816 kB
  • sloc: ml: 199,939; ansic: 9,666; sh: 6,913; makefile: 6,032; lisp: 2,747; yacc: 894; sed: 201; cpp: 87; awk: 5
file content (38 lines) | stat: -rw-r--r-- 1,033 bytes parent folder | download | duplicates (11)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
\DOC define_set_abstraction_syntax

\TYPE {define_set_abstraction_syntax : (string -> void)}

\SYNOPSIS
Sets up an interpretation of set abstraction syntax.

\DESCRIBE
The HOL quotation parser supports the notation {"{{x | P}}"}. This is primarily
intended for use in the {sets} library and dependent work, meaning `the set of
elements {x} such that {P} is true' (presumably {x} will be free in {P}), but
this function allows the interpretation to be changed. A call
{
   define_set_abstraction_syntax `c`
}
\noindent where {c} is a constant of the current theory, will make the
quotation parser interpret
{
   {{x | P}}
}
\noindent as
{
   c (\(x1...xn). (x,P))
}
\noindent where the {x1...xn} are all the variables that occur free in both
{x} or {P}.  The printer will invert this transformation.

\FAILURE
Fails if {c} is not a constant of the current theory.

\COMMENTS
For further details about the use of this function in the {sets} library, refer
to the DESCRIPTION.

\SEEALSO
define_finite_set_syntax, load_library.

\ENDDOC