Programming Languages and Systems

5th Asian Symposium, APLAS 2007, Singapore, November 28-December 1, 2007, Proceedings

AvZhong Shao

Häftad, Engelska, 2007

Del i serien Lecture Notes in Computer Science

566 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 5th Asian Symposium on Programming Languages and Systems, APLAS 2007, held in Singapore, in November/December 2007. The 25 revised full papers presented together with three invited talks were carefully reviewed and selected from 84 submissions. The symposium addresses all issues in programming languages and systems - ranging from foundational to practical issues. The papers focus on a broad range of topics.

Produktinformation

Utgivningsdatum:2007-11-07
Mått:155 x 235 x 25 mm
Vikt:674 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:436
Upplaga:2007
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540766360

Utforska kategorier

Programspråk inom Data och IT

Innehållsförteckning

Invited Talk 1.- X10: Concurrent Programming for Modern Architectures.- The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification.- Local Reasoning for Storable Locks and Threads.- Monadic, Prompt Lazy Assertions in Haskell.- Translation Correctness for First-Order Object-Oriented Pattern Matching.- Persistent Oberon: A Programming Language with Integrated Persistence.- More Typed Assembly Languages for Confidentiality.- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics.- On a Tighter Integration of Functional and Logic Programming.- Invited Talk 2.- Scalable Simulation of Cellular Signaling Networks.- Timed, Distributed, Probabilistic, Typed Processes.- A Probabilistic Applied Pi–Calculus.- Type-Based Verification of Correspondence Assertions for Communication Protocols.- Deriving Compilers and Virtual Machines for a Multi-level Language.- Finally Tagless, Partially Evaluated.- Polymorphic Delimited Continuations.- Adjunct Elimination in Context Logic for Trees.- Positive Arithmetic Without Exchange Is a Subclassical Logic.- Mixed Inductive/Coinductive Types and Strong Normalization.- Invited Talk 3.- Static and Dynamic Analysis: Better Together.- The Semantics of “Semantic Patches” in Coccinelle: Program Transformation for the Working Programmer.- An Efficient SSA-Based Algorithm for Complete Global Value Numbering.- A Systematic Approach to Probabilistic Pointer Analysis.- Complete Lattices and Up-To Techniques.- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract.- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence.- Call-by-Name and Call-by-Value in Normal Modal Logic.- Call-by-Value Is Dual to Call-by-Name, Extended.