Programs as Data Objects
Proceedings of a Workshop, Copenhagen, Denmark, October 17 - 19, 1985
Published on 1. March 1986
Book
Paperback/Softback
X, 325 pages
978-3-540-16446-3 (ISBN)
Description
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.
More details
Series
Edition
1986 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 325 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 19 mm
Weight
517 gr
ISBN-13
978-3-540-16446-3 (9783540164463)
DOI
10.1007/3-540-16446-4
Schweitzer Classification
Content
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.