找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Concrete Semantics; With Isabelle/HOL Tobias Nipkow,Gerwin Klein Textbook 2014 Springer International Publishing Switzerland 2014 Abstract

[復(fù)制鏈接]
查看: 38269|回復(fù): 52
樓主
發(fā)表于 2025-3-21 17:29:47 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Concrete Semantics
副標(biāo)題With Isabelle/HOL
編輯Tobias Nipkow,Gerwin Klein
視頻videohttp://file.papertrans.cn/236/235132/235132.mp4
概述Suitable for graduate students and researchers in theoretical computer science and logic.Teaches reader the art of precise logical reasoning and the practical use of a proof assistant.Represents a for
圖書封面Titlebook: Concrete Semantics; With Isabelle/HOL Tobias Nipkow,Gerwin Klein Textbook 2014 Springer International Publishing Switzerland 2014 Abstract
描述.Part I of this book is a practical introduction to working with the Isabelle proof assistant. It teaches you how to write functional programs and inductive definitions and how to prove properties about them in Isabelle’s structured proof language. Part II is an introduction to the semantics of imperative languages with an emphasis on applications like compilers and program analysers. The distinguishing feature is that all the mathematics has been formalised in Isabelle and much of it is executable. Part I focusses on the details of proofs in Isabelle; Part II can be read even without familiarity with Isabelle’s proof language, all proofs are described in detail but informally..The book teaches the reader the art of precise logical reasoning and the practical use of a proof assistant as a surgical tool for formal proofs about computer science artefacts. In this sense it represents a formal approach to computer science, not just semantics. The Isabelle formalisation, including the proofs and accompanying slides, are freely available online, and the book is suitable for graduate students, advanced undergraduate students, and researchers in theoretical computer science and logic..
出版日期Textbook 2014
關(guān)鍵詞Abstract interpretation; Automated reasoning; Compilers; Denotational semantics; Functional programming;
版次1
doihttps://doi.org/10.1007/978-3-319-10542-0
isbn_softcover978-3-319-35759-1
isbn_ebook978-3-319-10542-0
copyrightSpringer International Publishing Switzerland 2014
The information of publication is updating

書目名稱Concrete Semantics影響因子(影響力)




書目名稱Concrete Semantics影響因子(影響力)學(xué)科排名




書目名稱Concrete Semantics網(wǎng)絡(luò)公開度




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




書目名稱Concrete Semantics被引頻次




書目名稱Concrete Semantics被引頻次學(xué)科排名




書目名稱Concrete Semantics年度引用




書目名稱Concrete Semantics年度引用學(xué)科排名




書目名稱Concrete Semantics讀者反饋




書目名稱Concrete Semantics讀者反饋學(xué)科排名




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:41:21 | 只看該作者
Isar: a Language for Structured Proofsured, not linear. (2) It is readable without its being run because you need to state what you are proving at any given point. Whereas apply-scripts are like assembly language programs, Isar proofs are like structured programs with comments. A typical Isar proof looks like this.
板凳
發(fā)表于 2025-3-22 03:17:03 | 只看該作者
地板
發(fā)表于 2025-3-22 05:20:19 | 只看該作者
5#
發(fā)表于 2025-3-22 09:48:08 | 只看該作者
Denotational Semanticst those rules do not tell us directly what the meaning of a command is. This is what denotational semantics is about: mapping syntactic objects to their denotation or meaning. In fact, we are already familiar with two examples, namely the evaluation of arithmetic and boolean expressions.
6#
發(fā)表于 2025-3-22 13:52:54 | 只看該作者
7#
發(fā)表于 2025-3-22 18:31:07 | 只看該作者
Globalization and the Gains from TradeThis chapter introduces HOL as a functional programming language and shows how to prove properties of functional programs by induction.
8#
發(fā)表于 2025-3-22 22:29:34 | 只看該作者
Labour and Labour Market Adjustment,The core syntax of formulas (form below) provides the standard logical constructs, in decreasing order of precedence.
9#
發(fā)表于 2025-3-23 03:36:19 | 只看該作者
Frederick van der Ploeg,Aart J. de ZeeuwThis chapter introduces HOL as a functional programming language and shows how to prove properties of functional programs by induction.
10#
發(fā)表于 2025-3-23 07:23:54 | 只看該作者
 關(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-16 16:04
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
马边| 东至县| 漳浦县| 揭西县| 安阳市| 景东| 行唐县| 巴彦淖尔市| 岫岩| 武功县| 潍坊市| 铜鼓县| 高雄市| 平顺县| 化州市| 临潭县| 定南县| 疏附县| 高安市| 镇原县| 旬阳县| 怀化市| 太白县| 金阳县| 平泉县| 开平市| 潼关县| 汝南县| 伊川县| 长春市| 梅河口市| 易门县| 梅河口市| 盐池县| 金塔县| 永吉县| 历史| 永泰县| 泰兴市| 邵东县| 正宁县|