File: type_match.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 (38 lines) | stat: -rw-r--r-- 1,356 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
33
34
35
36
37
38
\DOC type_match

\TYPE {type_match : hol_type -> hol_type -> (hol_type * hol_type) list -> (hol_type * hol_type) list}

\SYNOPSIS
Computes a type instantiation to match one type to another.

\DESCRIBE
The call {type_match vty cty []} will if possible find an instantiation of the 
type variables in {vty} to make it the same as {cty}, and will fail if this is 
not possible. The instantiation is returned in a list of term-variable pairs as 
expected by type instantiation operations like {inst} and {INST_TYPE}. More 
generally, {type_match vty cty env} will attempt to find such a match assuming 
that the instantiations already in the list {env} are needed (this is helpful, 
for example, in matching multiple pairs of types in parallel).

\FAILURE
Fails if there is no match under the chosen constraints.

\EXAMPLE
Here is a basic example with an empty last argument:
{
  # type_match `:A->B->bool` `:num->num->bool` [];;
  val it : (hol_type * hol_type) list = [(`:num`, `:A`); (`:num`, `:B`)]
}
\noindent and here is an illustration of how the extra argument can be used to 
perform parallel matches.
{
  # itlist2 type_match
      [`:A->A->bool`; `:B->B->bool`] [`:num->num->bool`; `:bool->bool->bool`]
      [];;
  val it : (hol_type * hol_type) list = [(`:num`, `:A`); (`:bool`, `:B`)]
}

\SEEALSO
inst, INST_TYPE, mk_mconst, term_match.

\ENDDOC