Amazon cover image
Image from Amazon.com

Programs as Data Objects [electronic resource] : Proceedings of a Workshop Copenhagen, Denmark, October 17–19, 1985 / edited by Harald Ganzinger, Neil D. Jones.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 217Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1986Description: X, 325 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540397861
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1015113 23
LOC classification:
  • QA76.9.L63
  • QA76.5913
  • QA76.63
Online resources:
Contents:
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK4716

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India