Name
Abstract | ||
|---|---|---|
Finite maps, functions defined on only a finite domain, occur often, particularly when reasoning about programming languages. This paper presents a theory of finite maps in HOL. We discuss the choice of representation, present the theory we have defined, and discuss the issue of defining recursive types containing finite maps. We also discuss decision procedures and give an example of the use of finite maps in developing the semantics of a small language. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-60275-5_61 | TPHOLs |
Keywords | Field | DocType |
finite maps,programming language | HOL,Finite model theory,Computer science,Algorithm,Theoretical computer science,Recursive language,Semantics,Recursion | Conference |
ISBN | Citations | PageRank |
3-540-60275-5 | 13 | 1.52 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Graham Collins | 1 | 72 | 6.19 |
| don syme | 2 | 251 | 27.52 |