Cantitate/Preț
Produs

Programming Languages and Systems: First Asian Symposium, APLAS 2003, Beijing, China, November 27-29, 2003, Proceedings: Lecture Notes in Computer Science, cartea 2895

Editat de Atsushi Ohori
en Limba Engleză Paperback – 12 noi 2003
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 Languages andSystems(APLAS2003)tookplaceinBeijing.Wereceived76papers,among which 24 were selected for the proceedings after serious evaluation, which fully demonstrates the high quality of the collected papers. I hereby, on behalf of the Program Committee and the Organization Committee of the symposium, would like to extend the warmest welcome and hearty thanks to all colleagues who attended the symposium, all scholars who generously contributed their papers, and all those who were actively dedicated to the organization of this symposium. Over the past decade, the Asian economy has undergone rapid development. Keeping pace with this accelerated economic growth, Asia has made great he- way in software, integrated circuits, mobile communication and the Internet. All this has laid a ?rm material foundation for undertaking theoretical research on computer science and programming languages. Therefore, to meet the incr- sing demands of the IT market, great opportunities and challenges in advanced research in these ?elds. I strongly believe that in the coming future, with the persistent e?orts of our colleagues, the Asian software industry and research on computer science will be important players in the world economy, on an equal footing with their counterparts in the United States and Europe.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33605 lei

Preț vechi: 42006 lei
-20% Nou

Puncte Express: 504

Preț estimativ în valută:
6434 6971$ 5372£

Carte tipărită la comandă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540205364
ISBN-10: 3540205365
Pagini: 448
Ilustrații: XIV, 434 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 1.03 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Caracteristici

Includes supplementary material: sn.pub/extras