Titlebook: Design and Implementation of Symbolic Computation Systems; International Sympos Alfonso Miola Conference proceedings 1993 Springer-Verlag B

吵鬧

Declarations and Specifications,g a finite family of syntactic substitutions that generate the space of all solutions to .. In this sense, one has a unification algorithm. Concerning (2), a technique is provided for reducing it to a sub-problem of (1) for which a decomposition method is available.

為現(xiàn)場(chǎng)

Mathematica: A system for doing mathematics by computer?,tle in some simple forms of proof. However, Mathematica does not yet seem to be the right setting for proving in the broad sense of the word as understood by the mathematics community. We give some arguments for this and develop some ideas how a future system for doing mathematics might look like.

莎草

知道

有角

抱怨

0302-9743 ), held in Gmunden,Austria, in September 1993.The growing importance of systems for symbolic computationhas greatly influenced the decision of organizing this thirdconference in the series: DISCO ‘93 focuses mainly on themost innovative methodological and technological aspects ofthe design and imple

奇怪

發(fā)起

Klaus Backhaus,Bernd Erichson,Rolf Weiberquirement is that all coercions between two types coincide, a property which is called ...We will prove a coherence theorem for a formal type system having several possibilities of coercions covering many important examples. Moreover, we will give some informal reasoning why the formally defined restrictions can be satisfied by an actual system.

碎片

https://doi.org/10.1007/978-1-4471-3014-7he introduction of metaclasses, facilitates the task, by allowing the inference of type classes. By means of type classes and existential types we construct subtype relations without involving coercions.

Torrid

Proving the correctness of algebraic implementations by the ISAR system,fication to be implemented, a concrete specification used as a basis for the implementation and an implementation construction. If all steps of the (interactive) proof procedure are performed the system has proved the correctness of the implementation step.