Proceedings of the Fourth Conference on Functional Programming Languages and Computer Architecture
FPCA, 1989.

@proceedings{FPCA-1989,
	address       = "London, England, United Kingdom",
	isbn          = "0-201-51389-7",
	publisher     = "{ACM Press}",
	title         = "{Proceedings of the Fourth Conference on Functional Programming Languages and Computer Architecture}",
	year          = 1989,
}

Contents (31 items)

7 ×#functional
5 ×#analysis
4 ×#parallel
3 ×#polymorphism
3 ×#source code
2 ×#approach
2 ×#architecture
2 ×#compilation
2 ×#complexity
2 ×#graph

FPCA-1989-Hunt #abstract interpretation #set

Frontiers and Open Sets in Abstract Interpretation (SH), pp. 1–13.

FPCA-1989-Mogensen #specification

Separating Binding Times in Language Specifications (TÆM), pp. 14–25.

FPCA-1989-Bloss #analysis #functional #implementation #performance

Update Analysis and the Efficient Implementation of Functional Aggregates (AGB), pp. 26–38.

FPCA-1989-Sestoft #parametricity

Replacing Function Parameters by Global Variables (PS), pp. 39–53.

FPCA-1989-JonesM #analysis #garbage collection

Computer-Time Garbage Collection by Sharing Analysis (SBJ, DLM), pp. 54–74.

FPCA-1989-Traub #approach #clustering #compilation #functional #strict

Compilation as Partitioning: A New Approach to Compiling Non-Strict Functional Languages (KRT), pp. 75–88.

FPCA-1989-Peterson

Untagged Data in Tagged Environments: Choosing Optimal Representations at Compile Time (JP), pp. 89–99.

FPCA-1989-Argo

Improving the Three Instruction Machine (GA), pp. 100–115.

FPCA-1989-Lester #architecture #compilation #distributed #named #recursion

Stacklessness: Compiling Recursion for a Distributed Architecture (DRL), pp. 116–128.

FPCA-1989-NielsonN #higher-order

Transformations on Higher-Order Functions (HRN, FN), pp. 129–143.

FPCA-1989-Rosendahl #analysis #automation #complexity

Automatic Complexity Analysis (MR), pp. 144–156.

FPCA-1989-BjernerH #analysis #approach #composition #first-order #functional #lazy evaluation #source code

A Composition Approach to Time Analysis of First Order Lazy Functional Programs (BB, SH), pp. 157–165.

FPCA-1989-RuncimanT #component #polymorphism

Retrieving Re-Usable Software Components by Polymorphic Type (CR, IT), pp. 166–173.

FPCA-1989-Rittri #library #using

Using Types as Search Keys in Function Libraries (MR), pp. 174–183.

FPCA-1989-JonesS

The Spineless Tagless G-Machine (SLPJ, JS), pp. 184–201.

FPCA-1989-AugustssonJ #graph #parallel #reduction

Parallel Graph Reduction with the -Machine (LA, TJ), pp. 202–213.

FPCA-1989-George #automaton #graph #parallel #reduction

An Abstract Machine for Parallel Graph Reduction (LG), pp. 214–229.

FPCA-1989-AriolaA #named #parallel

P-TAC: A Parallel Intermediate Language (ZMA, A), pp. 230–242.

FPCA-1989-WeissSS #architecture #array #data-driven

Architectural Improvements for Data-Driven VLSI Processing Arrays (SW, IYS, GMS), pp. 243–259.

FPCA-1989-KuoM #analysis #strict #type inference

Strictness Analysis: A New Perspective Based on Type Inference (TMK, PM), pp. 260–272.

FPCA-1989-CanningCHOM #bound #morphism #object-oriented #polymorphism #programming

F-Bounded Polymorphism for Object-Oriented Programming (PSC, WRC, WLH, WGO, JCM), pp. 273–280.

FPCA-1989-Ohori #ml #morphism #polymorphism #semantics

A Simple Semantics for ML Polymorphism (AO), pp. 281–292.

FPCA-1989-WandO #complexity #on the #type inference

On the Complexity of Type Inference with Coercion (MW, PO), pp. 293–298.

FPCA-1989-Takayama #performance #proving #source code

Extended Projection — New Method to Extract Efficient Programs from Constructive Proofs (YT), pp. 299–312.

FPCA-1989-SilbermannJ #abstraction #functional #logic programming #set

Set Abstraction in Functional and Logic Programming (FSKS, BJ), pp. 313–326.

FPCA-1989-RufW #functional #logic #nondeterminism #programming #unification

Nondeterminism and Unification in LogScheme: Integrating Logic and Functional Programming (ER, DW), pp. 327–339.

FPCA-1989-Burton #behaviour #parallel #semantics #source code

Indeterminate Behavior with Determinate Semantics in Parallel Programs (FWB), pp. 340–346.

FPCA-1989-Wadler #exclamation #for free #theorem

Theorems for Free! (PW), pp. 347–359.

FPCA-1989-Mauny #embedded #functional #parsing

Parsers and Printers as Stream Destructors and Constructors Embedded in Functional Languages (MM), pp. 360–370.

FPCA-1989-Dwelly #user interface

Functions and Dynamic User Interfaces (AD), pp. 371–381.

FPCA-1989-Arya #animation #functional #process

Processes in a Functional Animation System (KA), pp. 382–395.