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

@proceedings{LFP-1990,
	address       = "Nice, France",
	isbn          = "0-89791-368-X",
	publisher     = "{ACM Press}",
	title         = "{Proceedings of the 1990 ACM Conference on LISP and Functional Programming}",
	year          = 1990,
}

Contents (32 items)

4 ×#functional
4 ×#parallel
3 ×#analysis
3 ×#compilation
3 ×#performance
3 ×#semantics
2 ×#automaton
2 ×#composition
2 ×#continuation
2 ×#lazy evaluation

LFP-1990-TolmachA #debugging #ml #reverse engineering #standard

Debugging Standard ML Without Reverse Engineering (APT, AWA), pp. 1–12.

LFP-1990-CurtisR

A Module System for Scheme (PC, JR), pp. 13–19.

LFP-1990-SheldonG #dependent type

Static Dependent Types for First Class Modules (MAS, DKG), pp. 20–29.

LFP-1990-CardelliL #semantics

A Semantic Basis for Quest (LC, GL), pp. 30–43.

LFP-1990-TannenGS

Computing with Coercions (VT, CAG, AS), pp. 44–60.

LFP-1990-Wadler #monad

Comprehending Monads (PW), pp. 61–78.

LFP-1990-Johnson #architecture #lisp

Trap Architectures for Lisp Systems (DJ), pp. 79–86.

LFP-1990-Zorn #garbage collection

Comparing Mark-and-Sweep and Stop-and-Copy Garbage Collection (BGZ), pp. 87–98.

LFP-1990-KiczalesR #performance

Efficient Method Dispatch in PCL (GK, LR), pp. 99–105.

LFP-1990-Hanson #performance #recursion #stack

Efficient Stack Allocation for Tail-Recursive Languages (CH), pp. 106–118.

LFP-1990-FeeleyM #compilation #parallel #performance #virtual machine

A Parallel Virtual Machine for Efficient Scheme Compilation (MF, JSM), pp. 119–130.

LFP-1990-WalinskyB #compilation #functional #parallel #programming language

A Functional Programming Language Compiler for Massively Parallel Computers (CW, DB), pp. 131–138.

LFP-1990-Berlin #partial evaluation

Partial Evaluation Applied to Numerical Computation (AB), pp. 139–150.

LFP-1990-DanvyF

Abstracting Control (OD, AF), pp. 151–160.

LFP-1990-SitaramF #abstraction #continuation #modelling #reasoning

Reasoning with Continuations II: Full Abstraction for Models of Control (DS, MF), pp. 161–175.

LFP-1990-KatzW #continuation #interactive

Continuing into the Future: On the Interaction of Futures and First-Class Continuations (MK, DW), pp. 176–184.

LFP-1990-MohrKH #lazy evaluation #parallel #source code

Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs (EM, DAK, RHHJ), pp. 185–197.

LFP-1990-Osborne #multi

Speculative Computation in Multilisp (RBO), pp. 198–208.

LFP-1990-GiorgiM #functional #implementation #parallel #programming language

Continuation-Based Parallel Implementation of Functional Programming Languages (JFG, DLM), pp. 209–217.

LFP-1990-Baker

Unify and Conquer (HGB), pp. 218–226.

LFP-1990-Burn #analysis #using

Using Projection Analysis of Evaluation-Order and Its Application (GLB), pp. 227–240.

LFP-1990-DraghicescuP #analysis #composition

A Compositional Analysis of Evaluation-Order and Its Application (MD, SP), pp. 242–250.

LFP-1990-NielsonN #code generation #information management #lazy evaluation

Context Information for Lazy Code Generation (HRN, FN), pp. 251–263.

LFP-1990-Consel #analysis #functional #higher-order

Binding Time Analysis for High Order Untyped Functional Languages (CC), pp. 264–272.

LFP-1990-PuelS #compilation #composition #pattern matching

Compiling Pattern Matching by Term Decomposition (LP, AS), pp. 273–281.

LFP-1990-Gomard #functional #source code #type inference

Partial Type Inference for Untyped Functional Programs (CKG), pp. 282–287.

LFP-1990-Leivant #morphism #polymorphism

Discrete Polymorphism (DL), pp. 288–297.

LFP-1990-HowardM #axiom #semantics

Operational and Axiomatic Semantics of PCF (BTH, JCM), pp. 298–306.

LFP-1990-FieldT #incremental #reduction #λ-calculus

Incremental Reduction in the λ Calculus (JF, TT), pp. 307–322.

LFP-1990-HannanM #automaton #semantics

From Operational Semantics to Abstract Machines: Preliminary Results (JH, DM), pp. 323–332.

LFP-1990-Cregut #automaton #normalisation

An Abstract Machine for λ-Terms Normalization (PC), pp. 333–340.

LFP-1990-NadathurW #representation

A Representation of λ Terms Suitable for Operations on Their Intensions (GN, DSW), pp. 341–348.