|
|
Conferences in DBLP
- Limsoon Wong
The functional guts of the Kleisli query system. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:1-10 [Conf]
- Haruo Hosoya, Jerome Vouillon, Benjamin C. Pierce
Regular expression types for XML. [Citation Graph (2, 0)][DBLP]
ICFP, 2000, pp:11-22 [Conf]
- Christian Queinnec
The influence of browsers on evaluators or, continuations to program web servers. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:23-33 [Conf]
- Christian Skalka, Scott F. Smith
Static enforcement of security with types. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:34-45 [Conf]
- François Pottier, Sylvain Conchon
Information flow inference for free. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:46-57 [Conf]
- Stephanie Weirich
Type-safe cast: functional pearl. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:58-67 [Conf]
- Karl Crary
Typed compilation of inclusive subtyping. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:68-81 [Conf]
- Valery Trifonov, Bratin Saha, Zhong Shao
Fully reflexive intensional type analysis. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:82-93 [Conf]
- Manuel M. T. Chakravarty, Gabriele Keller
More types for nested data parallel programming. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:94-105 [Conf]
- Meurig Sage
FranTk - a declarative GUI language for Haskell. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:106-117 [Conf]
- Brian McNamara, Yannis Smaragdakis
Functional programming in C++. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:118-129 [Conf]
- Robert Harper, Benjamin C. Pierce
Advanced module systems: a guide for the perplexed (abstract of invited talk). [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:130- [Conf]
- Chris Okasaki
Breadth-first numbering: lessons from a small exercise in algorithm design. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:131-136 [Conf]
- Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:137-149 [Conf]
- Karl-Filip Faxén
Cheap eagerness: speculative evaluation in a lazy functional language. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:150-161 [Conf]
- Clement A. Baker-Finch, David J. King, Philip W. Trinder
An operational semantics for parallel lazy evaluation. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:162-173 [Conf]
- Levent Erkök, John Launchbury
Recursive monadic bindings. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:174-185 [Conf]
- Ralf Hinze
Deriving backtracking monad transformers. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:186-197 [Conf]
- Rowan Davies, Frank Pfenning
Intersection types and computational effects. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:198-208 [Conf]
- Daniel Damian, Olivier Danvy
Syntactic accidents in program analysis: on the impact of the CPS transformation. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:209-220 [Conf]
- Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce
Recursive subtyping revealed: functional pearl. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:221-231 [Conf]
- Pierre-Louis Curien, Hugo Herbelin
The duality of computation. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:233-243 [Conf]
- Carl-Johan H. Seger
Combining functional programming and hardware verification (abstract of invited talk). [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:244- [Conf]
- Manuel Serrano, Hans-Juergen Boehm
Understanding memory allocation of scheme programs. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:245-256 [Conf]
- Andrew M. Cheadle, A. J. Field, Simon Marlow, Simon L. Peyton Jones, R. Lyndon While
Non-stop Haskell. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:257-267 [Conf]
- Koen Claessen, John Hughes
QuickCheck: a lightweight tool for random testing of Haskell programs. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:268-279 [Conf]
- Simon L. Peyton Jones, Jean-Marc Eber, Julian Seward
Composing contracts: an adventure in financial engineering, functional pearl. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:280-292 [Conf]
|
