Constructing Programs as Executable Attribute Grammars
From MaRDI portal
Recommendations
Cited in
(18)- Interpreting a dynamic and uncertain world: task-based control
- Modularity and reusability in attribute grammars
- Inductive attribute grammars: A basis for incremental program execution
- First-class attribute grammars
- Fred: An approach to generating real, correct, reusable programs from proofs
- Declarative term graph attribution for program generation
- Attribute grammars fly first-class: how to do aspect oriented programming in Haskell
- scientific article; zbMATH DE number 1002574 (Why is no real title available?)
- scientific article; zbMATH DE number 4180776 (Why is no real title available?)
- scientific article; zbMATH DE number 4195156 (Why is no real title available?)
- scientific article; zbMATH DE number 3978354 (Why is no real title available?)
- scientific article; zbMATH DE number 4031017 (Why is no real title available?)
- scientific article; zbMATH DE number 4033046 (Why is no real title available?)
- scientific article; zbMATH DE number 1174532 (Why is no real title available?)
- scientific article; zbMATH DE number 2018594 (Why is no real title available?)
- scientific article; zbMATH DE number 2087565 (Why is no real title available?)
- Advanced Functional Programming
- Zipper-based attribute grammars and their extensions
This page was built for publication: Constructing Programs as Executable Attribute Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4019939)