Titlebook: Design and Implementation of Symbolic Computation Systems; International Sympos Jacques Calmet,Carla Limongelli Conference proceedings 1996

Rodent

Throttle

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

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

裝飾

和平主義

煞費苦心

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

高原

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

平

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