Amazon cover image
Image from Amazon.com
Image from Google Jackets

Programs as Data Objects [electronic resource] : Second Symposium, PADO2001 Aarhus, Denmark, May 21–23, 2001 Proceedings / edited by Olivier Danvy, Andrzej Filinski.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 2053Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2001Description: X, 286 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540449782
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:
Invited Opening Talk -- Program Analysis for Implicit Computational Complexity -- Contributed Papers -- Deriving Pre-conditions for Array Bound Check Elimination -- Type Systems for Useless-Variable Elimination -- Boolean Constraints for Binding-Time Analysis -- Constraint Abstractions -- Implementing Circularity Using Partial Evaluation -- Combining Forward And Backward Analyses of Temporal Properties -- Numerical Power Analysis -- Run-Time Bytecode Specialization -- A New Numerical Abstract Domain Based on Difference-Bound Matrices -- Partial Evaluation for Class-Based Object-Oriented Languages -- Driving in the Jungle -- Higher-Order Pattern Matching for Automatically Applying Fusion Transformations -- Dynamic Partial Evaluation -- Tag Elimination and Jones-Optimality -- Invited Closing Talk -- Bottom-Up Deduction with Deletion and Priorities.
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 EBK5101

Invited Opening Talk -- Program Analysis for Implicit Computational Complexity -- Contributed Papers -- Deriving Pre-conditions for Array Bound Check Elimination -- Type Systems for Useless-Variable Elimination -- Boolean Constraints for Binding-Time Analysis -- Constraint Abstractions -- Implementing Circularity Using Partial Evaluation -- Combining Forward And Backward Analyses of Temporal Properties -- Numerical Power Analysis -- Run-Time Bytecode Specialization -- A New Numerical Abstract Domain Based on Difference-Bound Matrices -- Partial Evaluation for Class-Based Object-Oriented Languages -- Driving in the Jungle -- Higher-Order Pattern Matching for Automatically Applying Fusion Transformations -- Dynamic Partial Evaluation -- Tag Elimination and Jones-Optimality -- Invited Closing Talk -- Bottom-Up Deduction with Deletion and Priorities.

There are no comments on this title.

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