Programs as Data Objects

Proceedings of a Workshop, Copenhagen, Denmark, October 17 - 19, 1985
Herausgegeben:Ganzinger, Harald; Jones, Neil D.

• Broschiertes Buch

Produktbeschreibung

Strictness analysis and polymorphic invariance.- Convergent term rewriting systems can be used for program transformation.- The theory of strictness analysis for higher order functions.- Recognition of generative languages.- Modular first-order specifications of operational semantics.- Logic specification of code generation techniques.- Strictness detection in non-flat domains.- Strictness computation using special ?-expressions.- A relational framework for abstract interpretation.- Expected forms of data flow analyses.- Code generation from two-level denotational meta-languages.- Multilevel functions in Martin-L¿f's type theory.- An implementation from a direct semantics definition.- The structure of a self-applicable partial evaluator.- Program transformation by supercompilation.- Listlessness is better than laziness II: Composing listless functions.- From interpreter to compiler: A representational derivation.

Produktdetails

• Lecture Notes in Computer Science 217
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-16446-3
• 1986.
• Seitenzahl: 340
• Erscheinungstermin: 1. März 1986
• Englisch
• Abmessung: 235mm x 155mm x 19mm
• Gewicht: 481g
• ISBN-13: 9783540164463
• ISBN-10: 3540164464
• Artikelnr.: 23119181

Inhaltsangabe

Strictness analysis and polymorphic invariance.- Convergent term rewriting systems can be used for program transformation.- The theory of strictness analysis for higher order functions.- Recognition of generative languages.- Modular first-order specifications of operational semantics.- Logic specification of code generation techniques.- Strictness detection in non-flat domains.- Strictness computation using special ?-expressions.- A relational framework for abstract interpretation.- Expected forms of data flow analyses.- Code generation from two-level denotational meta-languages.- Multilevel functions in Martin-Löf's type theory.- An implementation from a direct semantics definition.- The structure of a self-applicable partial evaluator.- Program transformation by supercompilation.- Listlessness is better than laziness II: Composing listless functions.- From interpreter to compiler: A representational derivation.