找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 葉子
61#
發(fā)表于 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.
62#
發(fā)表于 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.
63#
發(fā)表于 2025-4-1 10:52:06 | 只看該作者
64#
發(fā)表于 2025-4-1 14:50:41 | 只看該作者
65#
發(fā)表于 2025-4-1 21:35:17 | 只看該作者
66#
發(fā)表于 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
67#
發(fā)表于 2025-4-2 04:31:40 | 只看該作者
68#
發(fā)表于 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.
69#
發(fā)表于 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.
70#
發(fā)表于 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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-2-5 19:23
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
三台县| 来宾市| 吉木萨尔县| 大田县| 田林县| 灵宝市| 老河口市| 伊通| 沂南县| 淮滨县| 望都县| 东海县| 潮安县| 砀山县| 安宁市| 利辛县| 安仁县| 灵石县| 织金县| 林口县| 平乐县| 新平| 扎鲁特旗| 桐柏县| 武隆县| 桃园市| 彰武县| 连平县| 平远县| 延边| 彭州市| 赤城县| 铜山县| 南溪县| 蒙自县| 左云县| 四平市| 弋阳县| 始兴县| 都江堰市| 清徐县|