Rodent
发表于 2025-3-25 07:19:02
http://reply.papertrans.cn/27/2686/268573/268573_21.png
Throttle
发表于 2025-3-25 09:24:06
L. Zechmeister,Y. Asahina,G. Zempléns own computation. Implementing meta-computation by high-level language enables us to access meta-level with high-abstract interface. In recent years this notion can be found in several fields of computer science and artificial intelligence. In particular, in the field of intelligent systems meta-co
Fluctuate
发表于 2025-3-25 15:38:32
A. Butenandt,U. Westphal,Th. Wielands and contexts and 2-morphisms represent reduction rules. In this context stability and compatibility properties of reduction can be proved. The proposed categorial view allows for a good level of expressivity of the reduction mechanisms, without constraining rewriting to the particular area where i
装饰
发表于 2025-3-25 19:48:55
http://reply.papertrans.cn/27/2686/268573/268573_24.png
和平主义
发表于 2025-3-25 22:37:27
http://reply.papertrans.cn/27/2686/268573/268573_25.png
煞费苦心
发表于 2025-3-26 02:56:34
https://doi.org/10.1007/978-3-7091-8656-5ies and Domains may contain conditionals in their bodies, which are elaborated by our compiler by techniques used in standard typing. We define an appropriate calculus and discuss its properties. Examples inspired by the Axiom library illustrate the power of our approach and its application in const
Basal-Ganglia
发表于 2025-3-26 07:22:14
http://reply.papertrans.cn/27/2686/268573/268573_27.png
高原
发表于 2025-3-26 11:41:11
https://doi.org/10.1007/978-3-7091-9242-9hemical metaphor is given to Z. Then, some Unity-like temporal logic constructs are defined on such a formal operational semantics in order to allow the specification and analysis of dynamic and temporal properties of concurrent systems, such as safety and liveness properties.
institute
发表于 2025-3-26 14:02:07
http://reply.papertrans.cn/27/2686/268573/268573_29.png
平
发表于 2025-3-26 18:14:47
G. W. Beadle,F. E. Brauns,R. S. Rasmussen one obtains linear speed-up (up to 29 times), using a serial-parallel scheme. A two-dimensional algorithm for multiplication of polynomials gives half-linear speed-up (up to 383 times). We also implement multiprecision rational arithmetic using known systolic algorithms for addition and multiplicat