GULP
发表于 2025-3-25 04:00:40
A constructor-based approach for positive/negative-conditional equational specifications,itional equations. Under the assumption of confluence of the reduction relation we define, the factor algebra of the ground term algebra modulo the congruence of this reduction relation is a minimal model which is (beyond that) the minimum of all models that do not identify more constructor ground terms than necessary.
TRUST
发表于 2025-3-25 09:08:02
http://reply.papertrans.cn/24/2353/235213/235213_22.png
Conflagration
发表于 2025-3-25 14:05:09
http://reply.papertrans.cn/24/2353/235213/235213_23.png
neutrophils
发表于 2025-3-25 16:33:01
http://reply.papertrans.cn/24/2353/235213/235213_24.png
细查
发表于 2025-3-25 20:56:38
http://reply.papertrans.cn/24/2353/235213/235213_25.png
欲望小妹
发表于 2025-3-26 00:14:33
Transactions on Computational Science XXIo conditional constructor systems. We show that both completeness (i.e. the combination of confluence and strong normalization) and semi-completeness (confluence plus weak normalization) are decomposable properties of conditional constructor systems without extra variables in the conditions of the r
Ankylo-
发表于 2025-3-26 05:08:27
S. K. Saha,R. Kar,D. Mandal,S. P. Ghoshalrees include applications of term rewrite rules as well as “folding steps” which identify common subexpressions. Different aspects of this model of computation are considered: (1) It is shown that collapsed tree rewriting is complete with respect to equational validity in the same sense as term rewr
刺耳的声音
发表于 2025-3-26 10:51:06
Marina L. Gavrilova,C. J. Kenneth Tanany rewrite rule is greater than the right-hand side and the terms occurring in the conditions of that rule. If a simplifying join CTRS consists of finitely many rules, it is terminating and the applicability of a rewrite rule is decidable by recursively reducing the terms in the conditions. Conside
易受骗
发表于 2025-3-26 14:51:59
Nikolay Tcholtchev,Ina Schieferdeckerte) terminating TRSs .., .. is non-terminating, then one of the systems, say .., enjoys an interesting property, namely it is not termination preserving under non-deterministic collapses, i.e. .. ⊕ {. is non-terminating, and the other system .. is collapsing, i.e. contains a rule with a variable rig
松软
发表于 2025-3-26 18:00:50
Zhengbiao Guo,Zhitang Li,Hao Tu,Da Xieiting systems in contrast to (extensions of) Tait-Girard‘s technique. In particular for some class of higher-order rule systems, we explicitly construct a well-founded ordering over .-terms whose combination with the .-reduction is terminating. Then, by embedding the higher-order rewriting relation