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

只看該作者 · 發(fā)表于 2025-3-25 10:35:52

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.

只看該作者 · 發(fā)表于 2025-3-25 15:39:16

只看該作者 · 發(fā)表于 2025-3-25 18:57:59

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

只看該作者 · 發(fā)表于 2025-3-25 21:13:54

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

只看該作者 · 發(fā)表于 2025-3-26 03:04:46

只看該作者 · 發(fā)表于 2025-3-26 07:42:40

只看該作者 · 發(fā)表于 2025-3-26 12:12:30

只看該作者 · 發(fā)表于 2025-3-26 14:26:11

只看該作者 · 發(fā)表于 2025-3-26 20:26:56

8樓

		自動登錄	找回密碼
密碼			To register

關于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經(jīng)驗總結	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-20 20:13
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權所有 All rights reserved