找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Higher-Order Computability; John Longley,Dag Normann Book 2015 Springer-Verlag Berlin Heidelberg 2015 Computability Models.Computability T

[復(fù)制鏈接]
查看: 31899|回復(fù): 54
樓主
發(fā)表于 2025-3-21 17:01:14 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Higher-Order Computability
編輯John Longley,Dag Normann
視頻videohttp://file.papertrans.cn/427/426992/426992.mp4
概述Valuable for researchers in mathematical logic and theoretical computer science.Consolidates work carried out in this domain since the 1950s.Asks what ‘computability’ means for data more complex than
叢書名稱Theory and Applications of Computability
圖書封面Titlebook: Higher-Order Computability;  John Longley,Dag Normann Book 2015 Springer-Verlag Berlin Heidelberg 2015 Computability Models.Computability T
描述.This book offers a self-contained exposition of the theory of computability in a higher-order context, where ‘computable operations‘ may themselves be passed as arguments to other computable operations. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages..?.In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them..?.The book will serve as an ideal introduction to the field for beginning graduate stude
出版日期Book 2015
關(guān)鍵詞Computability Models; Computability Theory; Intensional Models; Kleene Computability; Lambda Algebras
版次1
doihttps://doi.org/10.1007/978-3-662-47992-6
isbn_softcover978-3-662-51711-6
isbn_ebook978-3-662-47992-6Series ISSN 2190-619X Series E-ISSN 2190-6203
issn_series 2190-619X
copyrightSpringer-Verlag Berlin Heidelberg 2015
The information of publication is updating

書目名稱Higher-Order Computability影響因子(影響力)




書目名稱Higher-Order Computability影響因子(影響力)學(xué)科排名




書目名稱Higher-Order Computability網(wǎng)絡(luò)公開度




書目名稱Higher-Order Computability網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Higher-Order Computability被引頻次




書目名稱Higher-Order Computability被引頻次學(xué)科排名




書目名稱Higher-Order Computability年度引用




書目名稱Higher-Order Computability年度引用學(xué)科排名




書目名稱Higher-Order Computability讀者反饋




書目名稱Higher-Order Computability讀者反饋學(xué)科排名




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

0票 0.00%

Perfect with Aesthetics

 

1票 100.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 20:50:47 | 只看該作者
Nested Sequential Proceduresnd Plotkin’s PCF (the subject of the next chapter). We shall consider NSPs both as forming a self-contained model of computation in their own right, and as a calculus of algorithms that can be interpreted in many other (total and partial) models.
板凳
發(fā)表于 2025-3-22 01:00:50 | 只看該作者
地板
發(fā)表于 2025-3-22 06:42:45 | 只看該作者
5#
發(fā)表于 2025-3-22 12:48:46 | 只看該作者
Book 2015e passed as arguments to other computable operations. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order compu
6#
發(fā)表于 2025-3-22 13:20:51 | 只看該作者
7#
發(fā)表于 2025-3-22 17:18:28 | 只看該作者
Kleene Computability in a Total Settingructures, following Kleene’s original approach. In the following chapter, we will investigate ways of adapting this concept of computability to a partial setting, focussing in particular on nested sequential procedures (see Subsection 3.2.5), which serve as a nexus between Kleene computability and Plotkin’s PCF.
8#
發(fā)表于 2025-3-22 21:57:01 | 只看該作者
9#
發(fā)表于 2025-3-23 04:03:18 | 只看該作者
10#
發(fā)表于 2025-3-23 06:34:59 | 只看該作者
 關(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, 2025-10-6 04:18
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
黑河市| 信宜市| 封丘县| 通河县| 交口县| 肥西县| 海兴县| 南溪县| 泾源县| 全州县| 车致| 宜阳县| 尖扎县| 茶陵县| 永定县| 墨脱县| 瓦房店市| 突泉县| 郸城县| 读书| 定南县| 岑巩县| 乌拉特前旗| 合山市| 白河县| 页游| 滦南县| 利津县| 茂名市| 宜阳县| 嘉鱼县| 乐都县| 望都县| 丰台区| 府谷县| 贵南县| 广汉市| 仪陇县| 加查县| 河池市| 荔浦县|