Charms of programming (requirements for a theory of . . .)

J. Durieux
{"title":"Charms of programming (requirements for a theory of . . .)","authors":"J. Durieux","doi":"10.1109/CMPEUR.1988.4949","DOIUrl":null,"url":null,"abstract":"The author identifies a unifying concept, called charm, for the substitution and binding mechanisms of logics, lambda-calculi, and programming languages. A survey of the algebraic properties of compositions of usual binding mechanisms shows that there is a common algebraic structure, from simple binding mechanisms like memories and environments to more complex ones like recursive systems or algebraic specifications. This common algebraic structure provides an outline for an unifying theory of charms of programming.<<ETX>>","PeriodicalId":415032,"journal":{"name":"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1988.4949","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The author identifies a unifying concept, called charm, for the substitution and binding mechanisms of logics, lambda-calculi, and programming languages. A survey of the algebraic properties of compositions of usual binding mechanisms shows that there is a common algebraic structure, from simple binding mechanisms like memories and environments to more complex ones like recursive systems or algebraic specifications. This common algebraic structure provides an outline for an unifying theory of charms of programming.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
编程的魅力(对…理论的要求)
作者为逻辑、lambda- calculus和编程语言的替换和绑定机制确定了一个统一的概念,称为charm。对通常绑定机制组合的代数性质的调查表明,存在一个共同的代数结构,从简单的绑定机制(如记忆和环境)到更复杂的绑定机制(如递归系统或代数规范)。这种常见的代数结构为程序设计魅力的统一理论提供了一个轮廓。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The automatic generation of graphical user interfaces Software engineering environments Computer-aided design of self-testable VLSI circuits An executable system specification to support the JSD methodology Guided synthesis and formal verification techniques for parameterized hardware modules
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1