Search for Author All Reviews
	Mosses, Peter     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       Rewriting extended regular expressions Antimirov V., Mosses P. Theoretical Computer Science 143(1): 51-72, 1995.  Type: Article The authors consider the extended algebra of regular events. They define a new system of Horn-equational axioms and prove its completeness for the ground equational theory of this algebra. The basic ideas are from Salomaa’s 1...... Sep 1 1996     On proving limiting completeness Mosses P., Plotkin G. (ed) SIAM Journal on Computing 16(1): 179-194, 1987.  Type: Article The authors of this paper attack the problem of proving the correspondence between a denotational semantics and an operational or rewriting semantics. In general, it is easy to prove that an operational semantics is consistent with the...... Jun 1 1989     A basic abstract semantic algebra Mosses P.  Semantics of data types (, Sophia-Antipolis, France, Jun 27-29, 1984) 1081984.  Type: Proceedings The author here continues his long-term project of trying to improve the modularity, modifiability, and comprehensibility of semantic descriptions by the use of “abstract semantic algebras” (i.e., axiomatically-spec...... Jun 1 1985
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy