Didier Rémi, Peter Lee
Proceedings of the Fourth International Conference on Functional Programming
ICFP, 1999.

@proceedings{ICFP-1999,
	address       = "Paris, France",
	editor        = "Didier Rémi and Peter Lee",
	isbn          = "1-58113-111-9",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Fourth International Conference on Functional Programming}",
	volume        = "SIGPLAN Notices 34(9), September 1999",
	year          = 1999,
}

Contents (25 items)

3 ×#functional
3 ×#ml
2 ×#haskell
2 ×#java
2 ×#programming language
2 ×#proving
2 ×#question
2 ×#recursion
2 ×#source code
2 ×#type inference

ICFP-1999-Longley #functional #question

When is a Functional Program Not a Functional Program? (JL), pp. 1–7.

ICFP-1999-SemmelrothS #encapsulation #ml #monad

Monadic Encapsulation in ML (MS, AS), pp. 8–17.

ICFP-1999-GanzFW

Trampolined Style (SEG, DPF, MW), pp. 18–27.

ICFP-1999-Okasaki #matrix #performance

From Fast Exponentiation to Square Matrices: An Adventure in Types (CO), pp. 28–35.

ICFP-1999-Nilsson #debugging #functional #lazy evaluation

Tracing Piece by Piece: Affordable Debugging for Lazy Functional Languages (HN), pp. 36–47.

ICFP-1999-ShiversCM #transaction

Atomic Heap Transactions and Fine-grain Interrupts (OS, JWC, RM), pp. 48–59.

ICFP-1999-LaunchburyLC #architecture #design #haskell #on the

On Embedding a Microarchitectural Design Language within Haskell (JL, JRL, BC), pp. 60–69.

ICFP-1999-HughesP #bound #embedded #ml #programming #recursion #towards

Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming (JH, LP), pp. 70–81.

ICFP-1999-Crary #parametricity #proving

A Simple Proof Technique for Certain Parametricity Results (KC), pp. 82–89.

ICFP-1999-KfouryMTW #type system

Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (AJK, HGM, FAT, JBW), pp. 90–101.

ICFP-1999-SplawskiU #fixpoint #recursion

Type Fixpoints: Iteration vs. Recursion (ZS, PU), pp. 102–113.

ICFP-1999-FinneLMJ

Calling Hell From Heaven and Heaven From Hell (SF, DL, EM, SLPJ), pp. 114–125.

ICFP-1999-BentonK #java

Interlanguage Working Without Tears: Blending SML with Java (NB, AK), pp. 126–137.

ICFP-1999-FlattFKF #lisp #operating system #programming language

Programming Languages as Operating Systems (or Revenge of the Son of the Lisp Machine) (MF, RBF, SK, MF), pp. 138–147.

ICFP-1999-WallaceR #combinator #haskell #question #type system #xml

Haskell and XML: Generic Combinators or Type-Based Translation? (MW, CR), pp. 148–159.

ICFP-1999-OhoriY #compilation #ml #morphism #polymorphism #rank #type inference

Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML (AO, NY), pp. 160–171.

ICFP-1999-Glew

Type Dispatch for Named Hierarchical Types (NG), pp. 172–182.

ICFP-1999-LeagueST #java #representation

Representing Java Classes in a Typed Intermediate Language (CL, ZS, VT), pp. 183–196.

ICFP-1999-ZdancewicGM #programming language #proving

Principals in Programming Languages: A Syntactic Proof Technique (SZ, DG, JGM), pp. 197–207.

ICFP-1999-Elsman

Static Interpretation of Modules (ME), pp. 208–219.

ICFP-1999-Shao

Transparent Modules with Fully Syntactic Signatures (ZS), pp. 220–232.

ICFP-1999-CraryW #analysis #flexibility

Flexible Type Analysis (KC, SW), pp. 233–248.

ICFP-1999-Chitil #deforestation #type inference

Type Inference Builds a Short Cut to Deforestation (OC), pp. 249–260.

ICFP-1999-Huch #abstract interpretation #erlang #source code #using #verification

Verification of Erlang Programs using Abstract Interpretation and Model Mhecking (FH), pp. 261–272.

ICFP-1999-AlpuenteHLV #functional #logic programming #source code

Specialization of Inductively Sequential Functional Logic Programs (MA, MH, SL, GV), pp. 273–283.