找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Isabelle/HOL; A Proof Assistant fo Tobias Nipkow,Markus Wenzel,Lawrence C. Paulson Textbook 2002 Springer-Verlag Berlin Heidelberg 2002 For

[復(fù)制鏈接]
查看: 36523|回復(fù): 47
樓主
發(fā)表于 2025-3-21 17:02:15 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Isabelle/HOL
副標(biāo)題A Proof Assistant fo
編輯Tobias Nipkow,Markus Wenzel,Lawrence C. Paulson
視頻videohttp://file.papertrans.cn/476/475519/475519.mp4
概述Includes supplementary material:
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Isabelle/HOL; A Proof Assistant fo Tobias Nipkow,Markus Wenzel,Lawrence C. Paulson Textbook 2002 Springer-Verlag Berlin Heidelberg 2002 For
描述This volume is a self-contained introduction to interactive proof in high- order logic (HOL), using the proof assistant Isabelle 2002. Compared with existing Isabelle documentation, it provides a direct route into higher-order logic, which most people prefer these days. It bypasses ?rst-order logic and minimizes discussion of meta-theory. It is written for potential users rather than for our colleagues in the research world. Another departure from previous documentation is that we describe Markus Wenzel’s proof script notation instead of ML tactic scripts. The l- ter make it easier to introduce new tactics on the ?y, but hardly anybody does that. Wenzel’s dedicated syntax is elegant, replacing for example eight simpli?cation tactics with a single method, namely simp, with associated - tions. The book has three parts. – The ?rst part, Elementary Techniques, shows how to model functional programs in higher-order logic. Early examples involve lists and the natural numbers. Most proofs are two steps long, consisting of induction on a chosen variable followed by the auto tactic. But even this elementary part covers such advanced topics as nested and mutual recursion. – The second part,
出版日期Textbook 2002
關(guān)鍵詞Formal Methods; Formal Reasoning; Formal Specification; Formal Verification; Functional Programming; High
版次1
doihttps://doi.org/10.1007/3-540-45949-9
isbn_softcover978-3-540-43376-7
isbn_ebook978-3-540-45949-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2002
The information of publication is updating

書目名稱Isabelle/HOL影響因子(影響力)




書目名稱Isabelle/HOL影響因子(影響力)學(xué)科排名




書目名稱Isabelle/HOL網(wǎng)絡(luò)公開度




書目名稱Isabelle/HOL網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Isabelle/HOL被引頻次




書目名稱Isabelle/HOL被引頻次學(xué)科排名




書目名稱Isabelle/HOL年度引用




書目名稱Isabelle/HOL年度引用學(xué)科排名




書目名稱Isabelle/HOL讀者反饋




書目名稱Isabelle/HOL讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:07:50 | 只看該作者
d others, where the exposure is automatically controlled, of kV only (single knob control). Again, with respect to focal spot size, some equipment permits free selection of focal spot size, within its rating, whilst other equipment is designed on the basis that the smallest focal spot should always
板凳
發(fā)表于 2025-3-22 03:32:30 | 只看該作者
地板
發(fā)表于 2025-3-22 06:47:39 | 只看該作者
5#
發(fā)表于 2025-3-22 12:48:52 | 只看該作者
6#
發(fā)表于 2025-3-22 16:47:22 | 只看該作者
7#
發(fā)表于 2025-3-22 19:51:20 | 只看該作者
8#
發(fā)表于 2025-3-23 00:18:40 | 只看該作者
3. More Functional Programmingive functions. The first two sections give a structured presentation of theorem proving by simplification (Sect. 3.1) and discuss important heuristics for induction (Sect. 3.2). You can skip them if you are not planning to perform proofs yourself. We then present a case study: a compiler for express
9#
發(fā)表于 2025-3-23 02:13:47 | 只看該作者
4. Presenting Theorieso present theories in a typographically pleasing manner. Isabelle provides a rich infrastructure for concrete syntax of the underlying π-calculus language (see Sect. 4.1), as well as document preparation of theory texts based on existingPD F-LATEX technology (see Sect. 4.2)..As pointed out by Leibni
10#
發(fā)表于 2025-3-23 09:09:18 | 只看該作者
5. The Rules of the Gameimplification, but any serious verification project require more elaborate forms of inference. The chapter also introduces the fundamentals of predicate logic. The first examples in this chapter will consist of detailed, low-level proof steps. Later, we shall see how to automate such reasoning using
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 14:58
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
中宁县| 莱芜市| 尉犁县| 宁夏| 平江县| 金川县| 五指山市| 盐山县| 新宁县| 土默特左旗| 海城市| 和田市| 东乡族自治县| 平泉县| 兴隆县| 吕梁市| 股票| 商洛市| 潜江市| 梓潼县| 双桥区| 四川省| 娄底市| 奉新县| 临颍县| 宁海县| 红桥区| 洛隆县| 湘潭县| 鞍山市| 阳西县| 延寿县| 葵青区| 成武县| 布尔津县| 固阳县| 邳州市| 民权县| 吴桥县| 乌拉特中旗| 宁国市|