Programming Languages and Systems 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25- April 2, 2000 Proceedings /

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

ETAPS 2000 was the third instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS),...

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

• Invited Paper
• Functional Nets
• Regular Papers
• Faithful Translations between Polyvariant Flows and Polymorphic Types
• On the Expressiveness of Event Notification in Data-Driven Coordination Languages
• Flow-Directed Closure Conversion for Typed Languages
• Directional Type Checking for Logic Programs: Beyond Discriminative Types
• Formalizing Implementation Strategies for First-Class Continuations
• Correctness of Java Card Method Lookup via Logical Relations
• Compile-Time Debugging of C Programs Working on Trees
• A Calculus for Compiling and Linking Classes
• Abstract Domains for Universal and Existential Properties
• A Type System for Bounded Space and Functional In-Place Update-Extended Abstract
• Secure Information Flow as Typed Process Behaviour
• Implementing Groundness Analysis with Definite Boolean Functions
• The Correctness of Type Specialisation
• Type Classes with Functional Dependencies
• Sharing Continuations: Proofnets for Languages with Explicit Control
• A Calculus for Link-Time Compilation
• Improving the Representation of Infinite Trees to Deal with Sets of Trees
• On the Translation of Procedures to Finite Machines
• A Kleene Analysis of Mobile Ambients
• A 3-Part Type Inference Engine
• First-Class Structures for Standard ML
• Constraint-Based Inter-Procedural Analysis of Parallel Programs
• Alias Types
• Polyvariant Flow Analysis with Constrained Types
• On Exceptions Versus Continuations in the Presence of State
• Equational Reasoning for Linking with First-Class Primitive Modules.