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. |
من داخل الكتاب
الصفحة 1
... Functional Nets Martin Odersky École Polytechnique Fédérale de Lausanne Abstract . Functional nets combine key ideas of functional program- ming and Petri nets to yield a simple and general programming nota- tion . They have their ...
... Functional Nets Martin Odersky École Polytechnique Fédérale de Lausanne Abstract . Functional nets combine key ideas of functional program- ming and Petri nets to yield a simple and general programming nota- tion . They have their ...
الصفحة 2
... functional nets is derived from Silk, a small language which maps directly into our object-based extension of join. An implementation of Silk is publicly available. There are also other languages which are based in some form on join ...
... functional nets is derived from Silk, a small language which maps directly into our object-based extension of join. An implementation of Silk is publicly available. There are also other languages which are based in some form on join ...
الصفحة 3
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 ... Functional Nets 3.
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 ... Functional Nets 3.
الصفحة 5
... functional nets . In a functional net , one often wants to export only some of the functions defined in a join pattern whereas other functions should remain hidden . Moreover , it is often necessary to call some of the hidden functions ...
... functional nets . In a functional net , one often wants to export only some of the functions defined in a join pattern whereas other functions should remain hidden . Moreover , it is often necessary to call some of the hidden functions ...
الصفحة 6
... Functional Programming A functional net that does not contain any occurrences of & is a purely functional program . For example , here's the factorial function written as a functional net . def factorial n = if ( n elsen == 0 ) 1 ...
... Functional Programming A functional net that does not contain any occurrences of & is a purely functional program . For example , here's the factorial function written as a functional net . def factorial n = if ( n elsen == 0 ) 1 ...
المحتوى
| 1 | |
| 26 | |
On the Expressiveness of Event Notification in DataDriven Coordination | 41 |
FlowDirected Closure Conversion for Typed Languages Henry Cejtin Entertainment Decisions Suresh Jagannathan | 56 |
Beyond Discriminative Types | 72 |
Formalizing Implementation Strategies for FirstClass Continuations | 88 |
Correctness of Java Card Method Lookup via Logical Relations Ewen Denney and Thomas Jensen IRISA | 104 |
CompileTime Debugging of C Programs Working on Jacob Elgaard Anders Møller and Michael I Schwartzbach Trees | 119 |
Type Classes with Functional Dependencies | 230 |
Proofnets for Languages with Explicit Control | 245 |
A Calculus for LinkTime Compilation | 260 |
Improving Laurent the Mauborgne Representation Ecole of Infinite Trees to Deal with Sets of Trees 275 Normale Supérieure | 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 |
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 CExp 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 Java join calculus label lambda calculus lattice Lemma linear logic LNCS Logic Programming m-calculus machine mapping method MLton module 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 Symposium syntactic syntax Theorem token translation tree type inference type specialiser type system type variables Xinks