orthodox 发表于 2025-3-30 10:43:49

http://reply.papertrans.cn/24/2353/235212/235212_51.png

Myofibrils 发表于 2025-3-30 14:59:50

Alexey Spizhevoy,Victor Eruhimovde class of problems dealing with choices defined by rules. Thus, we get rid of the specific term pattern matching problem. We also develop other topics, in order to produce functional code for normalization, using a “by value” strategy.

CRUC 发表于 2025-3-30 19:55:27

http://reply.papertrans.cn/24/2353/235212/235212_53.png

爱国者 发表于 2025-3-30 22:11:03

http://reply.papertrans.cn/24/2353/235212/235212_54.png

Virtues 发表于 2025-3-31 04:27:12

http://reply.papertrans.cn/24/2353/235212/235212_55.png

性满足 发表于 2025-3-31 06:01:17

http://reply.papertrans.cn/24/2353/235212/235212_56.png

arrogant 发表于 2025-3-31 11:41:09

A completion procedure for conditional equations,dure has been designed to also handle nonreductive equations that are generated during completion. The paper in particular presents techniques for simplification of conditional equations and rules, so that the procedure terminates on more specifications. The correctness proofs which form a substanti

词汇记忆方法 发表于 2025-3-31 17:19:40

http://reply.papertrans.cn/24/2353/235212/235212_58.png

散步 发表于 2025-3-31 18:32:53

Equational axiomatizations of if-then-else,extra operations, predicates and equations among those. We give similar completeness results for continuous algebras and program schemes (infinite trees) by the methods of algebraic semantics. These extensions provide a purely equational proof system to prove properties of functional programs over u

竖琴 发表于 2025-4-1 01:00:20

http://reply.papertrans.cn/24/2353/235212/235212_60.png
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Conditional Term Rewriting Systems; 1st International Wo S. Kaplan,J. -P. Jouannaud Conference proceedings 1988 Springer-Verlag Berlin Heid