SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Attribute grammars as a functional programming paradigm
Proc. of a conference on Functional programming languages and computer architecture
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Information Processing Letters - Special issue on the calculational method
Algebra of programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Functional Programming
Introduction to Functional Programming
Strictness Analysis for Attribute Grammars
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Forwarding in Attribute Grammars for Modular Language Design
CC '02 Proceedings of the 11th International Conference on Compiler Construction
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Forwarding in Attribute Grammars for Modular Language Design
CC '02 Proceedings of the 11th International Conference on Compiler Construction
Logical Relations and Galois Connections
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Safety of abstract interpretations for free, via logical relations and Galois connections
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Merging Hierarchically-Structured Documents in Workflow Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A definition of the semantics of attribute grammars is given, using the lambda calculus. We show how this semantics allows us to prove results about attribute grammars in a calculational style. In particular, we give a new proof of Chirica and Martin's result [6], that the attribute values can be computed by a structural recursion over the tree. We also derive a new definedness test, which encompasses the traditional closure and circularity tests. The test is derived by abstract interpretation.