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.
Cite
CITATION STYLE
Avenhaus, J., & Becker, K. (1994). Operational specifications with built-ins. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 263–274). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_147
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
