制定法律
发表于 2025-3-30 12:15:16
http://reply.papertrans.cn/17/1663/166228/166228_51.png
容易生皱纹
发表于 2025-3-30 13:48:30
http://reply.papertrans.cn/17/1663/166228/166228_52.png
GLARE
发表于 2025-3-30 17:46:27
Logic programming with ions,ic programming framework. To this end, we generalize the notion of an ion introduced in , and develop our alternative to the language and metalanguage amalgamation approach suggested by Bowen and Kowalski .
远地点
发表于 2025-3-31 00:18:18
Inverse image analysis,erse image of a Scott open set under the continuous function which the program denotes. Inverse image analysis is one possible way of extending strictness analysis to languages with lazy data structures and could perhaps be used to optimise code in implementations of such languages.
Priapism
发表于 2025-3-31 00:52:21
A unification algorithm for confluent theories, an extension of the standard unification algorithm invented by Martelli and Montanari . It is demand driven and can handle infinite and partial instantiated objects and thus can be used as a means to integrate functional and logic programming.
体贴
发表于 2025-3-31 05:48:53
http://reply.papertrans.cn/17/1663/166228/166228_56.png
Coronary-Spasm
发表于 2025-3-31 11:05:45
On word problems in equational theories,l if it generates equations which cannot be oriented into rules (i.e., the system is not .), or if it generates infinitely many rules (i.e., the system is not .). In 1981 Huet showed that even if the system is not confluent, the Knuth-Bendix procedure still yields a semi-decision procedure for word
范例
发表于 2025-3-31 16:25:39
Another look at abstraction in process algebra, In this paper, we look at abstraction in the framework of the Algebra of Communicating Processes (see BERGSTRA & KLOP ). We introduce a hidden step η, and construct a model for the resulting theory ACP.. We briefly look at recursive specifications in this theory, and discuss the relations wit
恶意
发表于 2025-3-31 18:42:55
http://reply.papertrans.cn/17/1663/166228/166228_59.png
无能力
发表于 2025-4-1 01:25:20
Non-uniform automata over groups, theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform .. , NUDFA characterizations of several important subclasses of .. , and a new proof of the old