Programs as Data Objects Proceedings of a Workshop Copenhagen, Denmark, October 17–19, 1985 / [electronic resource] :
edited by Harald Ganzinger, Neil D. Jones.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 1986.
- X, 325 p. online resource.
- Lecture Notes in Computer Science, 217 0302-9743 ; .
- Lecture Notes in Computer Science, 217 .
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.
9783540397861
10.1007/3-540-16446-4 doi
Computer science.
Software engineering.
Logic design.
Computer Science.
Logics and Meanings of Programs.
Programming Techniques.
Software Engineering.
QA76.9.L63 QA76.5913 QA76.63
005.1015113
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.
9783540397861
10.1007/3-540-16446-4 doi
Computer science.
Software engineering.
Logic design.
Computer Science.
Logics and Meanings of Programs.
Programming Techniques.
Software Engineering.
QA76.9.L63 QA76.5913 QA76.63
005.1015113