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

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),...

Mô tả đầy đủ

Đã lưu trong:
Chi tiết về thư mục
Nhiều tác giả của công ty: European symposium on programming :Berlin, European joint conferences on theory and practice of software (Tác giả)
Tác giả khác: Smolka, Gert (Giám đốc xuất bản)
Định dạng: Livre numérique
Ngôn ngữ:Anglais
Được phát hành: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Loạt:Lecture notes in computer science 1782
Những chủ đề:
Truy cập trực tuyến:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Chú thích: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• 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, Gert Smolka (ed.), 2000, Berlin, Springer, 1 vol. (XIII-428 p.), Lecture notes in computer science, 3-540-67262-1
• Programming Languages and Systems, Texte imprimé, 9783662203538
Mục lục:
  • 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.