Neil D. Jones
Proceedings of the Third European Symposium on Programming
ESOP, 1990.

@proceedings{ESOP-1990,
	address       = "Copenhagen, Denmark",
	editor        = "Neil D. Jones",
	isbn          = "3-540-52592-0",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Third European Symposium on Programming}",
	volume        = 432,
	year          = 1990,
}

Contents (26 items)

4 ×#analysis
4 ×#implementation
3 ×#higher-order
3 ×#logic
2 ×#functional
2 ×#graph
2 ×#lazy evaluation
2 ×#logic programming
2 ×#on the
2 ×#programming language

ESOP-1990-BarendregtH #programming language #λ-calculus

Types in λ Calculi and Programming Languages (HB, KH), pp. 1–35.

ESOP-1990-Paige #difference #finite

Symbolic Finite Differencing — Part I (RP), pp. 36–56.

ESOP-1990-Bertot #implementation #interpreter #parallel

Implementation of an Interpreter for a Parallel Language in Centaur (YB), pp. 57–69.

ESOP-1990-Bondorf #automation #equation #higher-order #recursion

Automatic Autoprojection of Higher Order Recursive Equations (AB), pp. 70–87.

ESOP-1990-ConselD #compilation

From Interpreting to Compiling Binding Times (CC, OD), pp. 88–105.

ESOP-1990-SchreyePRB #constraints #implementation #logic programming #prolog

Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism (DDS, DP, JR, MB), pp. 106–117.

ESOP-1990-EvenS #action semantics #semantics #type inference

Type Inference for Action Semantics (SE, DAS), pp. 118–133.

ESOP-1990-Felleisen #on the #power of #programming language

On the Expressive Power of Programming Languages (MF), pp. 134–151.

ESOP-1990-GoldbergP #analysis #functional #higher-order #implementation #optimisation #stack

Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations (BG, YGP), pp. 152–160.

ESOP-1990-Gribomont #concurrent #development #incremental

Development of Concurrent Systems by Incremental Transformations (EPG), pp. 161–176.

ESOP-1990-Heckmann #set

Set Domains (RH), pp. 177–196.

ESOP-1990-Helmink #type system

Resolution and Type Theory (LH), pp. 197–211.

ESOP-1990-JeffersonLF

A Syntactic Theory of Transparent Parameterization (SJ, SDL, DPF), pp. 212–226.

ESOP-1990-JensenM #analysis #garbage collection

A Backwards Analysis for Compile-time Garbage Collection (TPJ, TÆM), pp. 227–239.

ESOP-1990-JourdanP #analysis

Techniques for Improving Grammar Flow Analysis (MJ, DP), pp. 240–255.

ESOP-1990-Kennaway #ambiguity #lazy evaluation #pattern matching #term rewriting

The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems (RK), pp. 256–270.

ESOP-1990-KuchenLMR #functional #graph #implementation #logic

Graph-based Implementation of a Functional Logic Langugage (HK, RL, JJMN, MRA), pp. 271–290.

ESOP-1990-NielsonN #exclamation #for free

Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations (HRN, FN), pp. 291–305.

ESOP-1990-ProiettiP #logic programming #source code #synthesis

Synthesis of Eureka Predicates for Developing Logic Programs (MP, AP), pp. 306–325.

ESOP-1990-Reps #algebra #integration

Algebraic Properties of Program Integration (TWR), pp. 326–340.

ESOP-1990-Romanenko

Arity Raiser and its Use in Program Specialization (SAR), pp. 341–360.

ESOP-1990-Sands #analysis #complexity #higher-order #lazy evaluation

Complexity Analysis for a Lazy Higher-Order Language (DS), pp. 361–376.

ESOP-1990-SchnoebelenP #logic #on the

On the Weak Adequacy of Branching-Time Remporal Logic (PS, SP), pp. 377–388.

ESOP-1990-SteffenKR #graph #program transformation #representation

The Value Flow Graph: A Program Representation for Optimal Program Transformations (BS, JK, OR), pp. 389–405.

ESOP-1990-Thatte #scalability #type inference

Type Inference and Implicit Scaling (ST), pp. 406–420.

ESOP-1990-Voronkov #formal method #logic #programming #towards

Towards the Theory of Programming in Constructive Logic (AV), pp. 421–435.