Programs as Data Objects Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings /
Programs as Data Objects Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings / [electronic resource] :
edited by Olivier Danvy, Andrzej Filinski.
- 1st ed. 2001.
- X, 286 p. online resource.
- Lecture Notes in Computer Science, 2053 1611-3349 ; .
- Lecture Notes in Computer Science, 2053 .
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.
9783540449782
10.1007/3-540-44978-7 doi
Computer science.
Data structures (Computer science).
Information theory.
Application software.
Compilers (Computer programs).
Machine theory.
Software engineering.
Computer Science Logic and Foundations of Programming.
Data Structures and Information Theory.
Computer and Information Systems Applications.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Software Engineering.
QA75.5-76.95
004.0151
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.
9783540449782
10.1007/3-540-44978-7 doi
Computer science.
Data structures (Computer science).
Information theory.
Application software.
Compilers (Computer programs).
Machine theory.
Software engineering.
Computer Science Logic and Foundations of Programming.
Data Structures and Information Theory.
Computer and Information Systems Applications.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Software Engineering.
QA75.5-76.95
004.0151