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 ProceedingsGert Smolka Springer, 26/06/2003 - 428 من الصفحات 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), ve satellite workshops (CBS, CMCS, CoFI, GRATRA, INT), seven invited lectures, a panel discussion, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment process, including speci cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Di erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive. |
من داخل الكتاب
الصفحة vii
... (names appear below). Once the initial reviews were available, we had two weeks for conflict resolution and paper selection, supported by a database system with Web interfaces. I would like to express my sincere gratitude to Christian ...
... (names appear below). Once the initial reviews were available, we had two weeks for conflict resolution and paper selection, supported by a database system with Web interfaces. I would like to express my sincere gratitude to Christian ...
الصفحة 2
... name. We will present object-based join calculus, an extension of join calculus with qualified definitions. This extension comes at surprisingly low cost, in the sense that the calculus needs to be changed only minimally and all ...
... name. We will present object-based join calculus, an extension of join calculus with qualified definitions. This extension comes at surprisingly low cost, in the sense that the calculus needs to be changed only minimally and all ...
الصفحة 4
... names, and subtyping is possible. The idiom for record access is standard. If r denotes a record, then r.f denotes the field of r named f. We also call references of the form r.f qualified names. The idiom for record creation is less ...
... names, and subtyping is possible. The idiom for record access is standard. If r denotes a record, then r.f denotes the field of r named f. We also call references of the form r.f qualified names. The idiom for record creation is less ...
الصفحة 5
... names with their values. This notion interacts poorly with the forms of definitions employed in functional nets. In a functional net, one often wants to export only some of the functions defined in a join pattern whereas other functions ...
... names with their values. This notion interacts poorly with the forms of definitions employed in functional nets. In a functional net, one often wants to export only some of the functions defined in a join pattern whereas other functions ...
الصفحة 7
... named List. List acts as a module, which provides the constructors of the list data type. Clients of the List module then construct lists using qualified names List.Nil and List.Cons. Example: def concat (xs, ys) = xs.match { def Nil ...
... named List. List acts as a module, which provides the constructors of the list data type. Clients of the List module then construct lists using qualified names List.Nil and List.Cons. Example: def concat (xs, ys) = xs.match { def Nil ...
المحتوى
| 1 | |
| 26 | |
On the Expressiveness of Event Notification in DataDriven Coordination | 41 |
FlowDirected Closure Conversion for Typed Languages | 56 |
Beyond Discriminative Types | 72 |
Formalizing Implementation Strategies for FirstClass Continuations | 88 |
Correctness of Java Card Method Lookup via Logical Relations | 104 |
CompileTime Debugging of C Programs Working on Trees | 119 |
Proofnets for Languages with Explicit Control | 245 |
A Calculus for LinkTime Compilation | 260 |
Improving the Representation of Infinite Trees to Deal with Sets of Trees | 275 |
On the Translation of Procedures to Finite Machines | 290 |
A Kleene Analysis of Mobile Ambients | 305 |
A 3Part Type Inference Engine | 320 |
FirstClass Structures for Standard ML | 336 |
ConstraintBased InterProcedural Analysis of Parallel Programs | 351 |
A Calculus for Compiling and Linking Classes | 135 |
Abstract Domains for Universal and Existential Properties | 150 |
A Type System for Bounded Space and Functional InPlace Update | 165 |
Secure Information Flow as Typed Process Behaviour | 180 |
Implementing Groundness Analysis with Definite Boolean Functions | 200 |
The Correctness of Type Specialisation | 215 |
Type Classes with Functional Dependencies | 230 |
Alias Types | 366 |
Polyvariant Flow Analysis with Constrained Types | 382 |
On Exceptions Versus Continuations in the Presence of State | 397 |
Equational Reasoning for Linking with FirstClass Primitive Modules | 412 |
Author Index | 429 |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
abstract abstract interpretation algorithm ambients application argument automata automaton call/cc closure compiler component Computer Science constraints constructor constructs context Core corresponding CPS programs CPS transformation data-polymorphic defined definition denotes encoding equivalent evaluation example execution paths expression finite first-class continuations flow analysis formal Functional Programming functor Galois Galois connection graph implementation join calculus label lambda calculus Lemma linear logic LNCS Logic Programming m-calculus mapping method MLton module names node operational semantics optimizations pointer polymorphism polyvariant predicate procedure program point Programming Languages proof recursive types reduction relation renaming represent representation result rewrite rules Section Springer-Verlag stack stack machine Standard ML static structure subtyping syntactic syntax Theorem token translation tree type inference type specialiser type system type variables