patriarch
发表于 2025-3-26 22:40:31
http://reply.papertrans.cn/59/5879/587860/587860_31.png
绅士
发表于 2025-3-27 03:46:03
http://reply.papertrans.cn/59/5879/587860/587860_32.png
谄媚于性
发表于 2025-3-27 05:24:00
http://reply.papertrans.cn/59/5879/587860/587860_33.png
granite
发表于 2025-3-27 12:03:03
http://reply.papertrans.cn/59/5879/587860/587860_34.png
Lamina
发表于 2025-3-27 17:39:30
http://reply.papertrans.cn/59/5879/587860/587860_35.png
打包
发表于 2025-3-27 18:08:10
A Technique for Modular Logic Program Refinement sets of procedures that manipulate the data types. By placing restrictions on the way a program uses a module, we develop a technique for refining the module so that it uses a more efficient representation of the data type.
Multiple
发表于 2025-3-27 22:43:52
http://reply.papertrans.cn/59/5879/587860/587860_37.png
嫌恶
发表于 2025-3-28 04:04:00
Specifying Prolog Trace Models with a Continuation Semanticss specification can be extended to specify richer Prolog trace models. To be able to experiment with trace models, we translate these specifications into ?Prolog. This translation leads to a Prolog interpreter that performs execution traces. We have hence a formal framework to specify, prototype, and validate Prolog trace models.
commonsense
发表于 2025-3-28 07:37:11
http://reply.papertrans.cn/59/5879/587860/587860_39.png
燕麦
发表于 2025-3-28 11:05:45
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderingslity-variants..The advantage of the approach over standard acceptability is that in some cases, where complex level mappings are needed, fairly simple termorderings may be easily generated. The advantage over transformational approaches is that it avoids the transformation step all together.