default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Functional Programming, Volume 11
Volume 11, Number 1, January 2001
- Ralph Benzinger:
Automated complexity analysis of Nuprl extracted programs Journal of Functional Programming. 3-31 - Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet:
Algorithms with polynomial interpretation termination proof. 33-53 - Neil D. Jones:
The expressive power of higher-order types or, life without CONS. 5-94 - Salvatore Caporaso, Emanuele Covino
, Giovanni Pani:
A predicative approach to the classification problem. 95-116 - Robert J. Irwin, James S. Royer, Bruce M. Kapron:
On characterizations of the basic feasible functionals (Part I). 117-153
Volume 11, Number 2, March 2001
- Margaret M. Burnett, John Atwood, Rebecca Walpole Djang, James Reichwein, Herkimer J. Gottfried, Sherry Yang:
Forms/3: A first-order visual language to explore the boundaries of the spreadsheet paradigm. 155-206 - Hélène Kirchner, Pierre-Etienne Moreau:
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories. 207-251
Volume 11, Number 3, May 2001
- Jens Palsberg, Christina Pavlopoulou:
From Polyvariant flow information to intersection and union types. 263-317 - Mitchell Wand, William D. Clinger:
Set constraints for destructive array update optimization. 319-346
- Richard S. Bird:
Unfolding pointer algorithms. 347-358
Volume 11, Number 4, July 2001
- Andrew J. Bennett, Paul H. J. Kelly, Ross A. Paterson:
Pipelined functional tree accesses and updates: scheduling, synchronization, caching and coherence. 359-393 - Nick Benton, Andrew Kennedy:
Exceptional Syntax Journal of Functional Programming. 395-410
- Richard S. Bird:
Maximum marking problems. 411-424 - Stefan Kahrs:
Red-black trees with types. 425-432
Volume 11, Number 5, September 2001
- Guy E. Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary L. Miller, Noel Walkington:
Persistent triangulations Journal of Functional Programming. 441-466 - Martin Erwig:
Inductive graphs and functional graph algorithms. 467-492 - Ralf Hinze:
Manufacturing datatypes. 493-524 - Graeme E. Moss, Colin Runciman:
Inductive benchmarking for purely functional data structures. 525-556 - Thomas Nordin, Andrew P. Tolmach:
Modular lazy search for Constraint Satisfaction Problems. 557-587
Volume 11, Number 6, November 2001
- Eugenio Moggi, Amr Sabry:
Monadic encapsulation of effects: a revised approach (extended version). 591-627 - Henrik Nilsson:
How to look busy while being as lazy as ever: the implementation of a lazy functional debugger. 629-671
- Olivier Danvy, Morten Rhiger, Kristoffer Høgsbro Rose:
Normalization by evaluation with typed abstract syntax. 673-680 - Ralf Hinze, Johan Jeuring:
Weaving a web. 681-689
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-10 20:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
