DocumentCode
3449979
Title
Charms of programming (requirements for a theory of . . .)
Author
Durieux, Jean-Louis
Author_Institution
ONERA-CERT-DERI, Toulouse, France
fYear
1988
fDate
11-14 Apr 1988
Firstpage
166
Lastpage
174
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
Keywords
programming; programming theory; algebraic properties; algebraic specifications; binding; charm; common algebraic structure; compositions; environments; lambda-calculi; logics; memories; programming languages; recursive systems; substitution; Algebra; Books; Calculus; Computer hacking; Computer science; Concurrent computing; Delay effects; Embedded computing; Equations; Pattern matching;
fLanguage
English
Publisher
ieee
Conference_Titel
CompEuro '88. 'Design: Concepts, Methods and Tools'
Conference_Location
Brussels
Print_ISBN
0-8186-0834-X
Type
conf
DOI
10.1109/CMPEUR.1988.4949
Filename
4949
Link To Document