Name
Abstract | ||
|---|---|---|
. An algorithm for a restricted form of higher-order matchingis described. The intended usage is for rewrite rules that use functionvaluedvariables in place of some unknown term structure. The matchingalgorithm instantiates these variables with suitable -abstractions whengiven the term to be rewritten. Each argument of one of the variablesis expected to match some unique substructure. Multiple solutions areavoided by making fixed choices when alternative ways to match arise.The... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-59200-8_66 | RTA |
Keywords | Field | DocType |
restricted form,higher-order rewriting applied,hdl semantics,term structure,higher order | Discrete mathematics,Correctness proofs,Programming language,Computer science,Algorithm,Confluence,Rewriting,Semantics,Blossom algorithm,Hardware description language | Conference |
ISBN | Citations | PageRank |
3-540-59200-8 | 2 | 0.42 |
References | Authors | |
7 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard J. Boulton | 1 | 255 | 23.64 |