exquisite
发表于 2025-3-28 16:57:23
http://reply.papertrans.cn/23/2202/220116/220116_41.png
CODE
发表于 2025-3-28 21:14:58
Emek Blair,Filip Sulc,Patrick J. Farmerthe . ... . ... . ... construct and their semantics is better defined "operationally" i.e. by means of an associated rewriting system than "denotationally" i.e. as the least fix-point of some operator. They appear in many different situations: denotational semantics, attribute grammars, algorithms i
Circumscribe
发表于 2025-3-29 02:58:11
http://reply.papertrans.cn/23/2202/220116/220116_43.png
贪婪性
发表于 2025-3-29 04:29:17
http://reply.papertrans.cn/23/2202/220116/220116_44.png
musicologist
发表于 2025-3-29 10:08:18
http://reply.papertrans.cn/23/2202/220116/220116_45.png
sclera
发表于 2025-3-29 13:33:16
Springer Proceedings in Physicsre an abstract model of computation to handle the case where some axioms cannot be treated as rewrite rules without loosing the required termination property. We call Equational Term Rewriting Systems such mixted sets of rules and equations. We show that two abstract properties, namely E-confluence
bisphosphonate
发表于 2025-3-29 19:18:45
Springer Proceedings in Physicsof specification language is given which provides an axiomatic framework for the various known specification techniques. (2) Algebraic specification languages which admit initial semantics are characterized up to equivalence. They are shown to be exactly the implicational languages.
臭了生气
发表于 2025-3-29 23:13:08
http://reply.papertrans.cn/23/2202/220116/220116_48.png
morale
发表于 2025-3-30 01:37:20
https://doi.org/10.1007/3-540-12727-5Morphism; algebra; algorithm; algorithms; automata; equation; grammars; programming; proof; semantics
garrulous
发表于 2025-3-30 05:16:51
978-3-540-12727-7Springer-Verlag Berlin Heidelberg 1983