|
|
Conferences in DBLP
- Brad A. Myers
Towards more natural functional programming languages. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:1- [Conf]
- Ralf Hinze
Bootstrapping one-sided flexible arrays. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:2-13 [Conf]
- Janis Voigtländer
Concatenate, reverse and map vanish for free. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:14-25 [Conf]
- Magnus Carlsson
Monads for incremental computing. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:26-35 [Conf]
- Bryan Ford
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:36-47 [Conf]
- Robert Bruce Findler, Matthias Felleisen
Contracts for higher-order functions. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:48-59 [Conf]
- Atsushi Ohori, Kiyoshi Yamatodani
An interoperable calculus for external object access. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:60-71 [Conf]
- Matthew Flatt
Composable and compilable macros: : you want it when? [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:72-83 [Conf]
- Danny Dubé, Marc Feeley
A demand-driven adaptive type analysis. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:84-97 [Conf]
- Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard
Exception analysis for non-strict languages. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:98-109 [Conf]
- Todd D. Millstein, Colin Bleckner, Craig Chambers
Modular typechecking for hierarchically extensible datatypes and functions. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:110-122 [Conf]
- J. Strother Moore
Functional formal methods. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:123- [Conf]
- Josef Svenningsson
Shortcut fusion for accumulating parameters & zip-like functions. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:124-132 [Conf]
- Christoph Lüth, Neil Ghani
Composing monads using coproducts. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:133-144 [Conf]
- Keith Hanna
Interactive visual functional programming. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:145-156 [Conf]
- Arthur I. Baars, S. Doaitse Swierstra
Typing dynamic typing. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:157-166 [Conf]
- Peter J. Stuckey, Martin Sulzmann
A theory of overloading. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:167-178 [Conf]
- Matthias Neubauer, Peter Thiemann
Type classes with more higher-order polymorphism. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:179-190 [Conf]
- Karl Crary, Joseph Vanderwaart
An expressive, scalable type theory for certified code. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:191-205 [Conf]
- Aleksandar Nanevski
Meta-programming with names and necessity. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:206-217 [Conf]
- Emir Pasalic, Walid Taha, Tim Sheard
Tagless staged interpreters for typed languages. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:218-229 [Conf]
- Olivier Danvy, Mayer Goldberg
There and back again. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:230-234 [Conf]
- Benjamin Grégoire, Xavier Leroy
A compiled implementation of strong reduction. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:235-246 [Conf]
- Lars Thomas Hansen, William D. Clinger
An experimental study of renewal-older-first garbage collection. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:247-258 [Conf]
- Bernard P. Serpette, Manuel Serrano
Compiling scheme to JVM bytecode: : a performance study. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:259-270 [Conf]
- Martin Gasbichler, Michael Sperber
Final shift for call/cc: : direct implementation of shift and reset. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:271-282 [Conf]
- Neil D. Jones, Arne J. Glenstrup
Program generation, termination, and binding-time analysis. [Citation Graph (0, 0)][DBLP]
ICFP, 2002, pp:283- [Conf]
|
