Deriving Target Code as a Representation of Continuation Semantics

DOI10.1145/357172.357179MaRDI QIDQ3942416zbMATH OpenOpenAlexFDO

Authors Mitchell Wand

Publication date 1982

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/357172.357179

zbMATH Keywords

programming languagesdenotational semanticslambda calculuscompilerscode generationcontinuation semanticsspecial-purpose combinators

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theory of operating systems (68N25)

Cited in

(16)

• Calculating certified compilers for non-deterministic languages
• Continuation-based compilation of functional languages for parallel machines
• From operational semantics to abstract machines
• Programming language semantics: It’s easy as 1,2,3
• Two-level semantics and code generation
• Functional un\(|\)unparsing
• Two-level semantics and abstract interpretation
• Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^†
• Pebble games for studying storage sharing
• Cutting Out Continuations
• A short proof of the lexical addressing algorithm
• Incorporating static analysis in a combinator-based compiler
• Towards type-directed compiler calculation
• Correctness of procedure representations in higher-order assembly language
• Calculating correct compilers
• Continuation semantics for flowgraph equations

This page was built for publication: Deriving Target Code as a Representation of Continuation Semantics

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