派博傳思國(guó)際中心

標(biāo)題: Titlebook: Categorical Combinators, Sequential Algorithms, and Functional Programming; Pierre-Louis Curien Book 1993 Springer Science+Business Media [打印本頁]

作者: 粗野的整個(gè) 時(shí)間: 2025-3-21 16:05
書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming影響因子(影響力)

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming影響因子(影響力)學(xué)科排名

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming網(wǎng)絡(luò)公開度

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming網(wǎng)絡(luò)公開度學(xué)科排名

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming被引頻次

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming被引頻次學(xué)科排名

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming年度引用

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming年度引用學(xué)科排名

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming讀者反饋

書目名稱Categorical Combinators, Sequential Algorithms, and Functional Programming讀者反饋學(xué)科排名

作者: 分開如此和諧 時(shí)間: 2025-3-21 22:04

作者: 環(huán)形 時(shí)間: 2025-3-22 01:44

作者: 注意 時(shí)間: 2025-3-22 05:48
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

作者: FELON 時(shí)間: 2025-3-22 09:50

作者: 口味 時(shí)間: 2025-3-22 13:42
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.

作者: 口味 時(shí)間: 2025-3-22 19:18

作者: Mechanics 時(shí)間: 2025-3-23 00:32

作者: 強(qiáng)行引入 時(shí)間: 2025-3-23 05:05
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.

作者: critique 時(shí)間: 2025-3-23 07:23

作者: 高深莫測(cè) 時(shí)間: 2025-3-23 11:36
C. Hamani,J. S. Neimat,Andres M. Lozanotions 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.

作者: 倒轉(zhuǎn) 時(shí)間: 2025-3-23 14:20
C. Hamani,J. S. Neimat,Andres M. Lozanoe a simple notion of approximation between concrete data structures, which allows us to solve domain equations in a naive way. The notion is connected with that of injection-projection pairs, used classically.

作者: cluster 時(shí)間: 2025-3-23 20:31
https://doi.org/10.1007/978-1-4612-0317-9algorithm; algorithms; calculus; data structure; data structures; functional programming; logic; programmin

作者: mydriatic 時(shí)間: 2025-3-24 01:58

作者: 方舟 時(shí)間: 2025-3-24 05:14

作者: Arbitrary 時(shí)間: 2025-3-24 08:59

作者: Militia 時(shí)間: 2025-3-24 11:54

作者: 注意力集中 時(shí)間: 2025-3-24 18:07

作者: 改變立場(chǎng) 時(shí)間: 2025-3-24 19:06

作者: PLAYS 時(shí)間: 2025-3-25 01:04
https://doi.org/10.1007/978-3-211-69295-0Syntax, computers push symbols. Why not the semantics? This could be the slogan of this book. We believe that sequential algorithms contribute to the “geometric” understanding of computation, advocated by Girard. Categorical combinators have contributed in formalizing numerous implementation issues of functional languages.

作者: arbovirus 時(shí)間: 2025-3-25 04:51

作者: 連鎖 時(shí)間: 2025-3-25 10:35
Conclusion,Syntax, computers push symbols. Why not the semantics? This could be the slogan of this book. We believe that sequential algorithms contribute to the “geometric” understanding of computation, advocated by Girard. Categorical combinators have contributed in formalizing numerous implementation issues of functional languages.

作者: Derogate 時(shí)間: 2025-3-25 15:39

作者: 外向者 時(shí)間: 2025-3-25 18:57
Book 1993ns 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

作者: 膽汁 時(shí)間: 2025-3-25 21:13
d 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 abstract978-1-4612-6704-1978-1-4612-0317-9

作者: 前奏曲 時(shí)間: 2025-3-26 03:04