Proceedings of the 1994 ACM Conference on LISP and Functional Programming
LFP, 1994.

@proceedings{LFP-1994,
	address       = "Orlando, Florida, USA",
	isbn          = "0-89791-643-3",
	publisher     = "{ACM Press}",
	title         = "{Proceedings of the 1994 ACM Conference on LISP and Functional Programming}",
	year          = 1994,
}

Contents (30 items)

5 ×#using
4 ×#garbage collection
3 ×#functional
3 ×#ml
2 ×#analysis
2 ×#higher-order
2 ×#implementation
2 ×#multi
2 ×#parallel
2 ×#re-engineering

LFP-1994-Tolmach #garbage collection #parametricity #using

Tag-Free Garbage Collection Using Explicit Type Parameters (APT), pp. 1–11.

LFP-1994-AdityaFH #garbage collection #re-engineering #runtime #using

Garbage Collection for Strongly-Typed Languages Using Run-Time Type Reconstruction (SA, CHF, JEH), pp. 12–23.

LFP-1994-Fradet #garbage collection

Collecting More Garbage (PF), pp. 24–33.

LFP-1994-OTooleN #concurrent #garbage collection

Concurrent Replicating Garbage Collection (JO, SN), pp. 34–42.

LFP-1994-StefanovicM #behaviour #ml #standard

Characterization of Object Behaviour in Standard ML of New Jersey (DS, JEBM), pp. 43–54.

LFP-1994-BiagioniHLM #ml #network #protocol #stack #standard

Signatures for a Network Protocol Stack: A Systems Application of Standard ML (EB, RH, PL, BM), pp. 55–64.

LFP-1994-ReistadG #execution

Static Dependent Costs for Estimating Execution Time (BR, DKG), pp. 65–78.

LFP-1994-HuelsbergenLA #data type #runtime #thread #using

Using the Run-Time Sizes of Data Structures to Guide Parallel-Thread Creation (LH, JRL, AA), pp. 79–90.

LFP-1994-Queinnec #continuation #locality

Locality, Causality and Continuations (CQ), pp. 91–102.

LFP-1994-JacobsS #lisp #persistent #semantics #syntax

Syntax and Semantics of a Persistent Common Lisp (JHJ, MRS), pp. 103–112.

LFP-1994-DavisPS #delivery

Talking About Modules and Delivery (HD, PP, NS), pp. 113–120.

LFP-1994-DavisPS94a

Sweet Harmony: The Talk/C++ Connection (HD, PP, NS), pp. 121–127.

LFP-1994-ClingerH #compilation #optimisation

λ, the Ultimate Label or a Simple Optimizing Compiler for Scheme (WDC, LTH), pp. 128–139.

LFP-1994-AshleyD #implementation #multi #performance

An Efficient Implementation of Multiple Return Values in Scheme (JMA, RKD), pp. 140–149.

LFP-1994-ShaoA

Space-Efficient Closure Representations (ZS, AWA), pp. 150–161.

LFP-1994-Hall #representation #type inference #using

Using Hindley-Milner Type Inference to Optimise List Representation (CVH), pp. 162–172.

LFP-1994-Chuang #array #functional #implementation #multi #random

A Randomized Implementation of Multiple Functional Arrays (TRC), pp. 173–184.

LFP-1994-ShaoRA

Unrolling Lists (ZS, JHR, AWA), pp. 185–195.

LFP-1994-KfouryW #algorithm #higher-order #type inference #λ-calculus

A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order λ-Calculus (AJK, JBW), pp. 196–207.

LFP-1994-Thatte #revisited #semantics

Semantics of Type Classes Revisited (SRT), pp. 208–219.

LFP-1994-Cosmadakis #algebra #proving

Complete Proof Systems for Algebraic Simply-Typed Terms (SSC), pp. 220–226.

LFP-1994-LawallD #partial evaluation

Continuation-Based Partial Evaluation (JLL, OD), pp. 227–238.

LFP-1994-DzengH #re-engineering

Type Reconstruction for Variable-Arity Procedures (HD, CTH), pp. 239–249.

LFP-1994-WrightC #type system

A Practical Soft Type System for Scheme (AKW, RC), pp. 250–262.

LFP-1994-SastryC #functional #parallel #strict

Parallel Destructive Updating in Strict Functional Languages (AVSS, WDC), pp. 263–272.

LFP-1994-DeanC #towards #using

Towards Better Inlining Decisions Using Inlining Trials (JD, CC), pp. 273–282.

LFP-1994-Biswas

In-Place Updates in the Presence of Control Operators (SKB), pp. 283–293.

LFP-1994-JagannathanW #parallel

Analyzing Stores and References in a Parallel Symbolic Language (SJ, SW), pp. 294–305.

LFP-1994-Heintze #analysis #ml #source code

Set-Based Analysis of ML Programs (NH), pp. 306–317.

LFP-1994-StefanescuZ #analysis #equation #framework #functional #higher-order #source code

An Equational Framework for the Flow Analysis of Higher Order Functional Programs (DCS, YZ), pp. 318–327.