File: ASM_FOL_TAC.doc

package info (click to toggle)
hol-light 20131026-1
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 26,264 kB
  • ctags: 4,620
  • sloc: ml: 400,325; cpp: 438; java: 279; lisp: 261; makefile: 256; sh: 190; yacc: 108; perl: 78; ansic: 57; sed: 39
file content (28 lines) | stat: -rw-r--r-- 911 bytes parent folder | download | duplicates (4)
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
\DOC ASM_FOL_TAC

\TYPE {ASM_FOL_TAC : (string * thm) list * term -> goalstate}

\SYNOPSIS
Fix up function arities for first-order proof search.

\DESCRIBE
This function attempts to make the assumptions of a goal more `first-order'. 
Functions that are not consistently used with the same arity, e.g. a function 
{f} that is sometimes applied {f(a)} and sometimes used as an argument to other 
functions, {g(f)}, will be identified. Applications of the function will then 
be modified by the introduction of the identity function {I} (which can be
thought of later as binary `function application') so that {f(a)} becomes 
{I f a}. This gives a more natural formulation as a prelude to traditional
first-order proof search.

\FAILURE
Never fails.

\COMMENTS
This function is not intended for general use, but is part of the initial
normalization in {MESON} and {MESON_TAC}.

\SEEALSO
MESON, MESON_TAC.

\ENDDOC