AROMA
发表于 2025-3-25 03:31:44
https://doi.org/10.1007/978-4-431-55948-1 program computes a TRS. For a relevant class of logic programs, called Simply Well Moded (SWM), there is a one-to-one correspondence between computed answer substitutions of the logic program and normal forms of the corresponding TRS. Moreover the transform preserves termination, i.e., a logic prog
类人猿
发表于 2025-3-25 10:50:55
Louise Colledge,Tim Whitfield,Zuzana Walkerermediate calls performed during the evaluation of a program. This information may be used in abstract interpretation as a basis for proving the soundness of program analyses. An example of this is the “closure analysis” of partial evaluation.
Eulogy
发表于 2025-3-25 12:36:33
Louise Colledge,Tim Whitfield,Zuzana Walker the surjective pairing axiom and a generalization of the .- conversion to patterns. We obtain a . reduction system by turning the extensional axioms as . rules, and then adding some restrictions to these expansions in order to avoid reduction loops. Confluence is proved by composition of modular pr
Recess
发表于 2025-3-25 17:44:52
Revisiting My Mother’s Story, My Storyation both alone and combined with the introduction of a new definition and fold operations. We prove that unfold always preserves universal termination. Moreover we define a restricted version of the Tamaki-Sato‘s transformation sequence and show that it preserves universal termination as well.
菊花
发表于 2025-3-25 21:31:20
http://reply.papertrans.cn/16/1528/152761/152761_25.png
正论
发表于 2025-3-26 01:32:35
https://doi.org/10.1007/3-540-58431-5Constraint Logic Programming; Logic Programming; algebraic programming; algebraisches Programmieren; hig
织布机
发表于 2025-3-26 05:50:36
978-3-540-58431-5Springer-Verlag Berlin Heidelberg 1994
BIDE
发表于 2025-3-26 10:39:48
Algebraic and Logic Programming978-3-540-48791-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
Credence
发表于 2025-3-26 14:19:49
https://doi.org/10.1007/978-4-431-55948-1obtain sufficient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination, (strong) termination, confluence and completeness of conditional rewrite systems.
谷类
发表于 2025-3-26 19:44:40
http://reply.papertrans.cn/16/1528/152761/152761_30.png