Name
Abstract | ||
|---|---|---|
We present a framework for studying equational specifications that partially specify functions over built-in structures. Using an order-sorted approach we are able to suitably assign semantics to such specifications in a denotational as well as an operational way. The operationalization, based on a combination of order-sorted and constraint based reasoning, enables us to generalize some basic results from classical rewrite theory. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-57785-8_147 | STACS |
Keywords | Field | DocType |
operational specifications | Discrete mathematics,Programming language,Partial algebra,Computer science,Constraint based reasoning,Critical pair,Operationalization,Constraint logic programming,Semantics | Conference |
ISBN | Citations | PageRank |
3-540-57785-8 | 7 | 0.57 |
References | Authors | |
12 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Avenhaus | 1 | 151 | 22.27 |
| Klaus Becker | 2 | 39 | 5.54 |