找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: 叶子
发表于 2025-4-1 04:05:46 | 显示全部楼层
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.
发表于 2025-4-1 06:21:27 | 显示全部楼层
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.
发表于 2025-4-1 10:52:06 | 显示全部楼层
发表于 2025-4-1 14:50:41 | 显示全部楼层
发表于 2025-4-1 21:35:17 | 显示全部楼层
发表于 2025-4-1 23:02:22 | 显示全部楼层
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
发表于 2025-4-2 04:31:40 | 显示全部楼层
发表于 2025-4-2 10:39:14 | 显示全部楼层
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.
发表于 2025-4-2 11:32:27 | 显示全部楼层
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.
发表于 2025-4-2 18:40:53 | 显示全部楼层
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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-23 11:43
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表