找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Categorical Combinators, Sequential Algorithms, and Functional Programming; Pierre-Louis Curien Book 1993 Springer Science+Business Media

[复制链接]
查看: 43532|回复: 38
发表于 2025-3-21 16:05:31 | 显示全部楼层 |阅读模式
书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming
编辑Pierre-Louis Curien
视频video
丛书名称Progress in Theoretical Computer Science
图书封面Titlebook: Categorical Combinators, Sequential Algorithms, and Functional Programming;  Pierre-Louis Curien Book 1993 Springer Science+Business Media
描述This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit­ man, in 1986. In addition to a general effort to improve typography, English, and presentation, the main novelty of this second edition is the integration of some new material. Part of it is mine (mostly jointly with coauthors). Here is brief guide to these additions. I have augmented the account of categorical combinatory logic with a description of the confluence properties of rewriting systems of categor­ ical combinators (Hardin, Yokouchi), and of the newly developed cal­ culi of explicit substitutions (Abadi, Cardelli, Curien, Hardin, Levy, and Rios), which are similar in spirit to the categorical combinatory logic, but are closer to the syntax of A-calculus (Section 1.2). The study of the full abstraction problem for PCF and extensions of it has been enriched with a new full abstraction result: the model of sequential algorithms is fully abstract with respect to an extension of PCF with a control operator (Cartwright, Felleisen, Curien). An order­ extensional model of error-sensitive sequential algorithms is also fully abstract
出版日期Book 1993
关键词algorithm; algorithms; calculus; data structure; data structures; functional programming; logic; programmin
版次1
doihttps://doi.org/10.1007/978-1-4612-0317-9
isbn_softcover978-1-4612-6704-1
isbn_ebook978-1-4612-0317-9
copyrightSpringer Science+Business Media New York 1993
The information of publication is updating

书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming影响因子(影响力)




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming影响因子(影响力)学科排名




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming网络公开度




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming网络公开度学科排名




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming被引频次




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming被引频次学科排名




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming年度引用




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming年度引用学科排名




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming读者反馈




书目名称Categorical Combinators, Sequential Algorithms, and Functional Programming读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:04:11 | 显示全部楼层
发表于 2025-3-22 01:44:51 | 显示全部楼层
发表于 2025-3-22 05:48:47 | 显示全部楼层
The Full Abstraction Problem,ehaviour: there are programs computing basic values, and procedures that cannot be evaluated by themselves, but only as part of a program. We focus on the language ., which is a typed λ-calculus with recursion and arithmetical constants. It has been studied by Plotkin [PloLCF] and Milner [MiFu]. The
发表于 2025-3-22 09:50:42 | 显示全部楼层
发表于 2025-3-22 13:42:55 | 显示全部楼层
Categorical Combinators,tions with respect to an environment. The weak rules naturally induce an abstract machine, the . (or CAM), where the categorical terms themselves, considered as machine code, act on a graph of values, with a stack to store pointers on this graph.
发表于 2025-3-22 19:18:28 | 显示全部楼层
发表于 2025-3-23 00:32:50 | 显示全部楼层
发表于 2025-3-23 05:05:41 | 显示全部楼层
Vers un Mode de Production Nonstandard, the language ., which is a typed λ-calculus with recursion and arithmetical constants. It has been studied by Plotkin [PloLCF] and Milner [MiFu]. The first section of this chapter is mainly devoted to their work.
发表于 2025-3-23 07:23:56 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 16:20
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表