Programs as Data Objects 1985: Copenhagen, Denmark

Harald Ganzinger, Neil D. Jones (Eds.): Programs as Data Objects, Proceedings of a Workshop, Copenhagen, Denmark, October 17-19, 1985. Lecture Notes in Computer Science 217 Springer 1986, ISBN 3-540-16446-4

Samson Abramsky:
Strictness analysis and polymorphic invariance. 1-23
Françoise Bellegarde:
Convergent term rewriting systems can be used for program transformation. 24-41
Geoffrey L. Burn, Chris Hankin, Samson Abramsky:
The theory of strictness analysis for higher order functions. 42-62
Henning Christiansen:
Recognition of generative languages. 63-81
Harald Ganzinger:
Modular first-order specifications of operational semantics. 82-95
Robert Giegerich:
Logic specification of code generation techniques. 96-111
John Hughes:
Strictness detection in non-flat domains. 112-135
Dieter Maurer:
Strictness computation using special lambda-expressions. 136-155
Alan Mycroft, Neil D. Jones:
A relational framework for abstract interpretation. 156-171
Flemming Nielson:
Expected forms of data flow analyses. 172-191
Flemming Nielson, Hanne Riis Nielson:
Code generation from two-level denotational meta-languages. 192-205
Bengt Nordström:
Multilevel functions in Martin-Löf's type theory. 206-221
David A. Schmidt:
An implementation from a direct semantics definition. 222-235
Peter Sestoft:
The structure of a self-applicable partial evaluator. 236-256
Valentin F. Turchin:
Program transformation by supercompilation. 257-281
Philip Wadler:
Listlessness is better than laziness II: composing listless functions. 282-305
Mitchell Wand:
From interpreter to compiler: a representational derivation. 306-324

Last update Sat May 18 19:32:58 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page