Deriving Target Code as a Representation of Continuation Semantics

DOI10.1145/357172.357179zbMath0483.68070OpenAlexW1987031623MaRDI QIDQ3942416

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)

Related Items (15)

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

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