Jean-Pierre Jouannaud
Proceedings of the Second Conference on Functional Programming Languages and Computer Architecture
FPCA, 1985.

@proceedings{FPCA-1985,
	address       = "Nancy, France",
	editor        = "Jean-Pierre Jouannaud",
	isbn          = "3-540-15975-4",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Second Conference on Functional Programming Languages and Computer Architecture}",
	volume        = 201,
	year          = 1985,
}

Contents (25 items)

5 ×#architecture
4 ×#named
3 ×#combinator
3 ×#functional
3 ×#recursion
3 ×#source code
2 ×#algorithm
2 ×#analysis
2 ×#data flow
2 ×#design

FPCA-1985-Turner85 #functional #named #polymorphism #strict

Miranda: A Non-Strict Functional language with Polymorphic Types (DAT), pp. 1–16.

FPCA-1985-SkedzielewskiW85 #data flow #graph #optimisation

Data Flow Graph Optimization in IF1 (SKS, MLW), pp. 17–34.

FPCA-1985-ClackJ85 #analysis #approach #strict

Strictness Analysis — A Practical Approach (CDC, SLPJ), pp. 35–49.

FPCA-1985-CousineauCM85 #automaton #category theory

The Categorical Abstract Machine (GC, PLC, MM), pp. 50–64.

FPCA-1985-Bellot85 #higher-order #programming

High Order Programming in Extended FP (PB), pp. 65–80.

FPCA-1985-AbramskyS85 #named #programming #virtual machine

Secd-m: a Virtual Machine for Applicative Programming (SA, RS), pp. 81–98.

FPCA-1985-HankinOS85 #architecture #combinator #named #reduction

COBWEB — A Combinator Reduction Architecture (CH, PO, MJS), pp. 99–112.

FPCA-1985-Wadler85 #backtracking #exception #functional #how #lazy evaluation #pattern matching

How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages (PW), pp. 113–128.

FPCA-1985-Hughes85 #lazy evaluation

Lazy Memo-functions (JH), pp. 129–146.

FPCA-1985-Plaisted85 #architecture #data flow #performance

An Architecture for fast Data Movement in the FFP Machine (DAP), pp. 147–163.

FPCA-1985-ODonnell85 #architecture

An Architecture that Efficiently Updates Associative Aggregates in Applicative Programing Languages (JTO), pp. 164–189.

FPCA-1985-Johnsson85 #equation #recursion #source code

λ Lifting: Treansforming Programs to Recursive Equations (TJ), pp. 190–203.

FPCA-1985-Debray85 #optimisation #prolog #recursion #source code

Optimizing Almost-Tail-Recursive Prolog Programs (SKD), pp. 204–219.

FPCA-1985-Sheeran85 #architecture #array #design #higher-order #using

Designing Regular Array Architectures using Higher Order Functions (MS), pp. 220–237.

FPCA-1985-PatelSE85 #algorithm #analysis #hardware #multi #named #specification #synthesis

vFP: An Environment for the Multi-level Specification, Analysis, and Synthesis of Hardware Algorithms (DP, MDFS, MDE), pp. 238–255.

FPCA-1985-Hughes85a #algorithm #distributed #garbage collection

A Distributed Garbage Collection Algorithm (JH), pp. 256–271.

FPCA-1985-Brownbridge85 #combinator

Cyclic Reference Counting for Combinator Machines (DRB), pp. 273–288.

FPCA-1985-Wise85 #design #multi

Design for a Multiprocessing Heap with On-board Reference Counting (DSW), pp. 289–304.

FPCA-1985-Young85 #architecture #composition #functional

A Functional Language and Modular Architecture for Scientific Computing (MFY), pp. 305–318.

FPCA-1985-Nikhil85 #morphism #polymorphism

Practical Polymorphism (RSN), pp. 319–333.

FPCA-1985-Dybjer85 #logic #verification

Program Verification in a Logical Theory of Constructions (PD), pp. 334–349.

FPCA-1985-BushG85 #execution #parallel #recursion #source code

Transforming Recursive Programs for Execution on Parallel Machines (VJB, JRG), pp. 350–367.

FPCA-1985-Augustsson85 #compilation #pattern matching

Compiling Pattern Matching (LA), pp. 368–381.

FPCA-1985-HudakG85 #combinator #parallel

Serial Combinators: “Optimal” Grains of Parallelism (PH, BG), pp. 382–399.

FPCA-1985-Kieburtz85 #performance

The G-Machine: A Fast, Graph-Reduction Evaluator (RBK), pp. 400–413.