编程的魅力(对…理论的要求)

[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools Pub Date : 1988-04-11 DOI:10.1109/CMPEUR.1988.4949

J. Durieux

{"title":"编程的魅力(对…理论的要求)","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":"{\"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}","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

摘要

作者为逻辑、lambda- calculus和编程语言的替换和绑定机制确定了一个统一的概念，称为charm。对通常绑定机制组合的代数性质的调查表明，存在一个共同的代数结构，从简单的绑定机制(如记忆和环境)到更复杂的绑定机制(如递归系统或代数规范)。这种常见的代数结构为程序设计魅力的统一理论提供了一个轮廓。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools

自引率

0.00%

发文量