File: mapf.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 (32 lines) | stat: -rw-r--r-- 944 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
29
30
31
32
\DOC mapf

\TYPE {mapf : ('a -> 'b) -> ('c, 'a) func -> ('c, 'b) func}

\SYNOPSIS
Maps a function over the range of a finite partial function

\DESCRIBE
This is one of a suite of operations on finite partial functions, type 
{('a,'b)func}. These may sometimes be preferable to ordinary functions since
they permit more operations such as equality comparison, extraction of domain
etc. The function {mapf f p} applies the (ordinary OCaml) function {f} to all 
the range elements of a finite partial function, so if it originally mapped 
{xi} to {yi} for it now maps {xi} to {f(yi)}.

\FAILURE
Fails if the function fails on one of the {yi}.

\EXAMPLE
{
  # let f = (1 |=> 2);;
  val f : (int, int) func = <func>
  # mapf string_of_int f;;
  val it : (int, string) func = <func>
  # apply it 1;;
}

\SEEALSO
|->, |=>, apply, applyd, choose, combine, defined, dom, foldl, foldr, 
graph, is_undefined, ran, tryapplyd, undefine, undefined.

\ENDDOC