Generating action compilers by partial evaluation

DOI10.1017/S0956796800001684zbMATH Open0856.68040WikidataQ123263383 ScholiaQ123263383MaRDI QIDQ4895553FDOQ4895553

Authors: Anders Bondorf, Jens Palsberg 

Publication date: 14 October 1996

Published in: Journal of Functional Programming (Search for Journal in Brave)

Recommendations

• Bootstrapping compiler generators from partial evaluators
• An action compiler targeting standard ML
• A convenient way to incorporate semantic actions in two‐pass compiling schemes
• Partial evaluation of computation process -- an approach to a compiler-compiler
• Composing programming languages by combining action-semantics modules.
• scientific article; zbMATH DE number 2036334
• Extending action language \(\mathcal{C}+\) by formalizing composite actions
• Constraint-based partial evaluation for imperative languages
• Combinators for program generation

zbMATH Keywords

Mosses' action semantics

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cites Work

• Automatic autoprojection of recursive equations with global variables and abstract data types
• Action Semantics
• Automatic autoprojection of higher order recursive equations

Cited In (4)

• An action compiler targeting standard ML
• From standard to non-standard semantics by semantics modifiers
• An Action Semantics Based on Two Combinators
• Efficient and flexible access control via Jones-optimal logic program specialisation

This page was built for publication: Generating action compilers by partial evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895553)