Skip to main content
Conference Proceedings

Nondeterministic algebraic specifications and nonconfluent term rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 343 LNCS 31-40
DOI: 10.1007/3-540-50667-5_56
4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Algebraic specifications are generalized to the case of nondeterministic operations by admitting models with set-valued functions (multi-algebras). General (in particular, non-confluent) term rewriting systems are considered as a specification language for this semantic framework. Correctness, completeness and initiality results are given.

Cite

CITATION STYLE

APA

Hussmann, H. (1988). Nondeterministic algebraic specifications and nonconfluent term rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 343 LNCS, pp. 31–40). Springer Verlag. https://doi.org/10.1007/3-540-50667-5_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free