Incorporating static analysis in a combinator-based compiler

DOI10.1016/0890-5401(89)90052-7zbMath0681.68015OpenAlexW2015091569WikidataQ123235145 ScholiaQ123235145MaRDI QIDQ1823653

Mitchell Wand, Margaret Montenyohl

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90052-7

zbMATH Keywords

optimizationdenotational semanticscompilerssemantic analysis

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01) Theory of software (68N99)

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A structured approach to static semantics correctness
• Towards a formal description of Ada
• A denotational framework for data flow analysis
• A theory of type polymorphism in programming
• Loops in combinator-based compilers
• Program transformations in a denotational setting
• Deriving Target Code as a Representation of Continuation Semantics
• The denotational semantics of programming languages
• A new implementation technique for applicative languages

This page was built for publication: Incorporating static analysis in a combinator-based compiler