default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Functional Programming, Volume 9
Volume 9, Number 1, January 1999
- Cormac Flanagan, Matthias Felleisen:
The Semantics of Future and an Application. 1-31 - Michael Hanus
, Christian Prehofer:
Higher-Order Narrowing with Definitional Trees. 33-75 - Richard S. Bird, Ross Paterson:
De Bruijn Notation as a Nested Datatype. 77-91 - Ralf Hinze:
Explaining Binomial Heaps. 93-104
Volume 9, Number 2, March 1999
- Richard J. Boulton:
Transparent Optimisation of Rewriting Combinators. 113-146 - Keith Hanna:
Implementing Theorem Provers in a Purely Functional Style. 147-166 - Christoph Lüth, Burkhart Wolff:
Functional Design and Implementation of Graphical User Interfaces for Theorem Provers. 167-189 - Olaf Müller, Tobias Nipkow, David von Oheimb, Oscar Slotosch:
HOLCF=HOL+LCF. 191-223 - Andrew Ireland, Alan Bundy:
Automatic Verification of Functions with Accumulating Parameters. 225-245
Volume 9, Number 3, May 1999
- Martin Hofmann:
Semantics of Linear/Modal Lambda Calculus. 247-277 - Christoph A. Herrmann, Christian Lengauer:
Parallelization of Divide-and-Conquer by Translation to Nested Loops. 279-310
- Koen Claessen:
A Poor Man's Concurrency Monad. 313-323 - M. Douglas McIlroy:
Power Series, Power Serious. 325-337 - Jeremy Gibbons:
A Pointless Derivation of Radix Sort. 339-346
Volume 9, Number 4, May 1999
- Graham Hutton:
A Tutorial on the Universality and Expressiveness of Fold. 355-372 - Andrew D. Gordon, Paul D. Hankin, Søren B. Lassen:
Compilation and Equivalence of Imperative Objects. 373-426 - Susumu Nishimura, Atsushi Ohori:
Parallel Functional Programming on Recursively Defined Data via Data-Parallel Recursion. 427-462
- Robert Harper:
Proof-Directed Debugging. 463-469 - Chris Okasaki:
Red-Black Trees in a Functional Setting. 471-477
Volume 9, Number 5, May 1999
- Peter Thiemann:
Combinators for Program Generation. 483-525 - Panos Rondogiannis, William W. Wadge:
Higher-Order Functional Languages and Intensional Logic. 527-564
- Richard Statman, Henk Barendregt:
Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. 565-575
Volume 9, Number 6, November 1999
- David Wakeling:
Compiling lazy functional programs for the Java Virtual Machine. 579-603 - Dinh Lê, Douglas Stott Parker Jr.:
Using randomization to make recursive matrix algorithms practical. 605-624 - Tristan Crolard:
A confluent lambda-calculus with a catch/throw mechanism. 625-647 - Alfons Geser, Sergei Gorlatch:
Parallelizing functional programs by generalization. 649-673
- Gilles Barthe:
Type-checking injective pure type systems. 685-698
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 2024-11-06 20:36 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:
