一再烦扰
发表于 2025-3-23 11:35:55
http://reply.papertrans.cn/43/4270/426989/426989_11.png
nonradioactive
发表于 2025-3-23 14:51:24
A complete proof system for Nested Term Graphs,acterization of the .-terms that unwind to the same tree, presented as a complete proof system. This paper gives a similar characterization for Nested Term Graphs. The semantics of tree unwinding is presented via bisimulations.
SUGAR
发表于 2025-3-23 19:26:59
Assertions and recursions,ctions or relations we obtain a framework which is independent of strict or non-strict, deterministic or non-deterministic semantics. Applications include efficiency increasing simplification of recursions as well as proofs about recursions by noetherian induction, such as termination proofs.
Substitution
发表于 2025-3-23 22:31:59
http://reply.papertrans.cn/43/4270/426989/426989_14.png
Adrenaline
发表于 2025-3-24 03:20:40
http://reply.papertrans.cn/43/4270/426989/426989_15.png
ingestion
发表于 2025-3-24 08:53:15
Conference proceedings 1996der Algebra, Logic, and Term Rewriting, HOA ‘95, held in Paderborn, Germany, in September 1995..The 14 research papers included, together with an invited paper by Jan Willem Klop, report state-of-the-art results; the relevant theoretical aspects are addressed, and in addition existing proof systems and term rewriting systems are discussed.
Celiac-Plexus
发表于 2025-3-24 13:33:43
http://reply.papertrans.cn/43/4270/426989/426989_17.png
弯腰
发表于 2025-3-24 18:34:48
978-3-540-61254-4Springer-Verlag Berlin Heidelberg 1996
Offensive
发表于 2025-3-24 22:03:06
http://reply.papertrans.cn/43/4270/426989/426989_19.png
加强防卫
发表于 2025-3-25 02:08:34
Term graph rewriting,We discuss some aspects of term graph rewriting based on systems of recursion equations. This is done for first-order signatures as well as lambda calculus. Also relations with infinitary rewriting are discussed.