Mitchell Wand, Simon L. Peyton Jones
Proceedings of the Seventh International Conference on Functional Programming
ICFP, 2002.

@proceedings{ICFP-2002,
	address       = "Pittsburgh, Pennsylvania, USA",
	editor        = "Mitchell Wand and Simon L. Peyton Jones",
	isbn          = "1-58113-487-8",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Seventh International Conference on Functional Programming}",
	volume        = "SIGPLAN Notices 37(9), September 2002",
	year          = 2002,
}

Contents (27 items)

4 ×#functional
3 ×#analysis
2 ×#composition
2 ×#formal method
2 ×#higher-order
2 ×#implementation
2 ×#metaprogramming
2 ×#monad
2 ×#type system

ICFP-2002-Myers #functional #programming language #towards

Towards more natural functional programming languages (BAM), p. 1.

ICFP-2002-Hinze #array #flexibility

Bootstrapping one-sided flexible arrays (RH), pp. 2–13.

ICFP-2002-Voigtlander #for free

Concatenate, reverse and map vanish for free (JV), pp. 14–25.

ICFP-2002-Carlsson #incremental #monad

Monads for incremental computing (MC), pp. 26–35.

ICFP-2002-Ford #functional #lazy evaluation #linear #parsing

Packrat parsing: : simple, powerful, lazy, linear time, functional pearl (BF), pp. 36–47.

ICFP-2002-FindlerF #contract #higher-order

Contracts for higher-order functions (RBF, MF), pp. 48–59.

ICFP-2002-OhoriY #calculus

An interoperable calculus for external object access (AO, KY), pp. 60–71.

ICFP-2002-Flatt #composition #metaprogramming #question

Composable and compilable macros: : you want it when? (MF), pp. 72–83.

ICFP-2002-DubeF #adaptation #analysis

A demand-driven adaptive type analysis (DD, MF), pp. 84–97.

ICFP-2002-GlynnSSS #analysis #exception #strict

Exception analysis for non-strict languages (KG, PJS, MS, HS), pp. 98–109.

ICFP-2002-MillsteinBC #composition #data type

Modular typechecking for hierarchically extensible datatypes and functions (TDM, CB, CC), pp. 110–122.

ICFP-2002-Moore #formal method #functional

Functional formal methods (JSM), p. 123.

ICFP-2002-Svenningsson #parametricity

Shortcut fusion for accumulating parameters & zip-like functions (JS), pp. 124–132.

ICFP-2002-LuthG #monad #using

Composing monads using coproducts (CL, NG), pp. 133–144.

ICFP-2002-Hanna #functional #interactive #programming #visual notation

Interactive visual functional programming (KH), pp. 145–156.

ICFP-2002-BaarsS #dynamic typing #type system

Typing dynamic typing (AIB, SDS), pp. 157–166.

ICFP-2002-StuckeyS #formal method

A theory of overloading (PJS, MS), pp. 167–178.

ICFP-2002-NeubauerT #higher-order #morphism #polymorphism

Type classes with more higher-order polymorphism (MN, PT), pp. 179–190.

ICFP-2002-CraryV #scalability #type system

An expressive, scalable type theory for certified code (KC, JV), pp. 191–205.

ICFP-2002-Nanevski #metaprogramming

Meta-programming with names and necessity (AN), pp. 206–217.

ICFP-2002-PasalicTS #staged

Tagless staged interpreters for typed languages (EP, WT, TS), pp. 218–229.

ICFP-2002-DanvyG

There and back again (OD, MG), pp. 230–234.

ICFP-2002-GregoireL #implementation #reduction

A compiled implementation of strong reduction (BG, XL), pp. 235–246.

ICFP-2002-HansenC #case study #garbage collection

An experimental study of renewal-older-first garbage collection (LTH, WDC), pp. 247–258.

ICFP-2002-SerpetteS #bytecode #compilation #performance #virtual machine

Compiling scheme to JVM bytecode: : a performance study (BPS, MS), pp. 259–270.

ICFP-2002-GasbichlerS #implementation

Final shift for call/cc: : direct implementation of shift and reset (MG, MS), pp. 271–282.

ICFP-2002-JonesG #analysis #generative #termination

Program generation, termination, and binding-time analysis (NDJ, AJG), p. 283.