Programming Languages and Systems First Asian Symposium, APLAS 2003, Beijing, China, November 27-29, 2003, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Ohori, Atsushi (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2895
• Θέματα: Programming languages (Electronic computers).; Software engineering.; Operating systems (Computers).; Computer logic.; Mathematical logic.; Programming Languages, Compilers, Interpreters.; Software Engineering.; Operating Systems.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.

With warm-hearted and friendly promotion by our Japanese friends Prof. - sushi Ohori, Prof. Tetsuo Ida, and Prof. Zhenjiang Hu, and other distinguished professors and scholars from countries and regions such as Japan, South Korea, Singapore, and Taiwan, the 1st Asian Symposium on Programming Languag...

Πίνακας περιεχομένων:

• Invited Talk 1
• On a Method of Global Optimization
• Session 1
• Observing Asymmetry and Mismatch
• Expressive Synchronization Types for Inheritance in the Join Calculus
• Term Graph Rewriting for the ?-Calculus
• Useless-Code Elimination and Program Slicing for the Pi-Calculus
• Session 2
• Constraint Functional Logic Programming for Origami Construction
• A Typeful and Tagless Representation for XML Documents
• Dataflow Pointcut in Aspect-Oriented Programming
• Session 3
• Affine-Based Size-Change Termination
• Using Locality of Flow in Dataflow Analyses
• A Differential Fixpoint Evaluation Framework for Non-distributive Systems
• Invited Talk 2
• Model Checking: From Hardware to Software
• Session 4
• Executing Verified Compiler Specification
• Controlling and Optimizing the Usage of One Resource
• Resource Usage Verification
• Automatic Construction of Hoare Proofs from Abstract Interpretation Results
• Session 5
• A Program Inverter for a Functional Language with Equality and Constructors
• Rebuilding a Tree from Its Traversals:
• Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver
• Session 6
• Continuation Semantics for Parallel Haskell Dialects
• Translating a Continuous-Time Temporal Logic into Timed Automata
• The Semantic Layers of Timber
• Invited Talk 3
• Scrap Your Boilerplate
• Session 7
• Correctness of a Higher-Order Removal Transformation through a Relational Reasoning
• Extensional Polymorphism by Flow Graph Dispatching
• Register Allocation Based on a Reference Flow Analysis
• Lazy Stack Copying and Stack Copy Sharing for the Efficient Implementation of Continuations.