找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 31827|回复: 54
发表于 2025-3-21 17:01:14 | 显示全部楼层 |阅读模式
书目名称Higher-Order Computability
编辑John Longley,Dag Normann
视频video
概述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
关键词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影响因子(影响力)学科排名




书目名称Higher-Order Computability网络公开度




书目名称Higher-Order Computability网络公开度学科排名




书目名称Higher-Order Computability被引频次




书目名称Higher-Order Computability被引频次学科排名




书目名称Higher-Order Computability年度引用




书目名称Higher-Order Computability年度引用学科排名




书目名称Higher-Order Computability读者反馈




书目名称Higher-Order Computability读者反馈学科排名




单选投票, 共有 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

您所在的用户组没有投票权限
发表于 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.
发表于 2025-3-22 01:00:50 | 显示全部楼层
发表于 2025-3-22 06:42:45 | 显示全部楼层
发表于 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
发表于 2025-3-22 13:20:51 | 显示全部楼层
发表于 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.
发表于 2025-3-22 21:57:01 | 显示全部楼层
发表于 2025-3-23 04:03:18 | 显示全部楼层
发表于 2025-3-23 06:34:59 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 11:24
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表