File: ELL_CONV.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 (32 lines) | stat: -rw-r--r-- 640 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
 
\DOC ELL_CONV

\TYPE {ELL_CONV : conv}

\SYNOPSIS
Computes by inference the result of indexing an element of a list.

\KEYWORDS
conversion, list.

\DESCRIBE
For any object language list of the form {"[xn-1;...;xk;...x0]"} ,
the result of evaluating
{
   ELL_CONV "ELL k [xn-1;...;xk;...;x0]"
}
\noindent is the theorem
{
   |- ELL k [xn-1;...;xk;...;x0] = xk
}
\noindent where {k} must not be greater then the length of the list.
Note that {ELL} index the list elements from the tail end.

\FAILURE
{ELL_CONV tm} fails if {tm} is not of the form described above, 
or {k} is not less than the length of the list.

\SEEALSO
EL_CONV

\ENDDOC