3. ESOP 1990:
Copenhagen, Denmark
Neil D. Jones (Ed.):
ESOP'90, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings.
Lecture Notes in Computer Science 432 Springer 1990, ISBN 3-540-52592-0 BibTeX
@proceedings{DBLP:conf/esop/1990,
editor = {Neil D. Jones},
title = {ESOP'90, 3rd European Symposium on Programming, Copenhagen, Denmark,
May 15-18, 1990, Proceedings},
booktitle = {ESOP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {432},
year = {1990},
isbn = {3-540-52592-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Henk Barendregt, Kees Hemerik:
Types in Lambda Calculi and Programming Languages.
1-35 BibTeX
- Robert Paige:
Symbolic Finite Differencing - Part I.
36-56 BibTeX
- Yves Bertot:
Implementation of an Interpreter for a Parallel Language in Centaur.
57-69 BibTeX
- Anders Bondorf:
Automatic Autoprojection of Higher Order Recursive Equations.
70-87 BibTeX
- Charles Consel, Olivier Danvy:
From Interpreting to Compiling Binding Times.
88-105 BibTeX
- Danny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe:
Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism.
106-117 BibTeX
- Susan Even, David A. Schmidt:
Type Inference for Action Semantics.
118-133 BibTeX
- Matthias Felleisen:
On the Expressive Power of Programming Languages.
134-151 BibTeX
- Benjamin Goldberg, Young Gil Park:
Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations.
152-160 BibTeX
- E. Pascal Gribomont:
Development of Concurrent Systems by Incremental Transformations.
161-176 BibTeX
- Reinhold Heckmann:
Set Domains.
177-196 BibTeX
- Leen Helmink:
Resolution and Type Theory.
197-211 BibTeX
- Stanley Jefferson, Shinn-Der Lee, Daniel P. Friedman:
A Syntactic Theory of Transparent Parameterization.
212-226 BibTeX
- Thomas P. Jensen, Torben Æ. Mogensen:
A Backwards Analysis for Compile-time Garbage Collection.
227-239 BibTeX
- Martin Jourdan, Didier Parigot:
Techniques for Improving Grammar Flow Analysis.
240-255 BibTeX
- Richard Kennaway:
The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems.
256-270 BibTeX
- Herbert Kuchen, Rita Loogen, Juan José Moreno-Navarro, Mario Rodríguez-Artalejo:
Graph-based Implementation of a Functional Logic Langugage.
271-290 BibTeX
- Hanne Riis Nielson, Flemming Nielson:
Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations.
291-305 BibTeX
- Maurizio Proietti, Alberto Pettorossi:
Synthesis of Eureka Predicates for Developing Logic Programs.
306-325 BibTeX
- Thomas W. Reps:
Algebraic Properties of Program Integration.
326-340 BibTeX
- Sergei A. Romanenko:
Arity Raiser and its Use in Program Specialization.
341-360 BibTeX
- David Sands:
Complexity Analysis for a Lazy Higher-Order Language.
361-376 BibTeX
- Ph. Schnoebelen, Sophie Pinchinat:
On the Weak Adequacy of Branching-Time Remporal Logic.
377-388 BibTeX
- Bernhard Steffen, Jens Knoop, Oliver Rüthing:
The Value Flow Graph: A Program Representation for Optimal Program Transformations.
389-405 BibTeX
- Satish Thatte:
Type Inference and Implicit Scaling.
406-420 BibTeX
- Andrei Voronkov:
Towards the Theory of Programming in Constructive Logic.
421-435 BibTeX
Copyright © Sat May 16 23:10:49 2009
by Michael Ley (ley@uni-trier.de)