Pieter H. Hartel
Koen G. Langendoen
- 1.L. Augustsson. Implementing HaskeU overloading. In 6th Functional programming languages and computer architecture, Copenhagen, Denmark, Jun 1993. ACM. Google Scholar
Digital Library
- 2.L. Augustsson and T. Johnsson. The Chalmers lazy- ML compiler. The comp~tter jmtrnal, 32(2):127-141, Apr 1989. Google ScholarDigital Library
- 3.L. Augustsson and T. Johnsson. Lazy ML user's manual. Programming methodology group report, Dept. of Comp. Sci, Chalmers Univ. of Technology, GSteborg, Sweden, 1990.Google Scholar
- 4.M. Beemster. The lazy functional intermediate language Stoffel. Technical report CS-92-16, Dept. of Comp. Sys, Univ. of Amsterdam, Dec 1992.Google Scholar
- 5.J. R. Davy. Using divide and conquer for parallel geometric evaluation. PhD thesis, School of Computer Studies, University of Leeds, England, Sep 1992.Google Scholar
- 6.J. Glas, R. F. H. Hofman, and W. G. Vree. Parallelization of branch-and-bound algorithms in a functional programming environment. In H. Kuchen and R. Loogen, editors, d th Parallel implementation o/functional lang~tages, pages 287-298, Aachen, Germany, Sep 1992. Aachener Informatik-Berichte 92-19, RWTH Aachen, Fachgruppe Informatik.Google Scholar
- 7.P. H. Hartel, H. W. Glaser, and J. M. Wild. Compilation of functional languages using flow graph analysis. Technical report CSTR 91-03, Dept. of Electr. and Comp. Sci, Univ. of Southampton, England, Jan 1991.Google Scholar
- 8.P. H. Hartel, H. W. Glaser, and J. M. Wild. FAST compiler user's guide. Technical report, Dept. of Electr. and Comp. Sci, Univ. of Southampton, England, Dec 1992.Google Scholar
- 9.P. H. Hartel and W. G. Vree. Arrays in a lazy functional language- a case study: the fast Fourier transform. In G. Hains and L. M. R. Mullin, editors, 2nd workshop on array structures (ATABLE), pages 52-66. Publication 841, Dept. d'informatique et de recherche opSrationelle, Univ. de Montreal, Canada, Jun 1992.Google Scholar
- 10.P. Hudak, S. L. Peyton Jones, and P. L. Wadler (editors). Report on the programming language Haskell - a non-strict purely functional language, version 1.2. SIGPLAN notices, 27(5):1-162, May 1992. Google ScholarDigital Library
- 11.K. G. Langendoen and P. tt. Hartel. FCG: a code generator for lazy functional languages. In U. Kastens and P. Pfahler, editors, Compiler construction (CC), LNCS 6d1, pages 278-296, Paderborn, Germany, Oct 1992. Springer-Verlag. Google ScholarDigital Library
- 12.H. L. Muller. Simulating computer architectures. PhD thesis, Dept. of Comp. Sys, Univ. of Amsterdam, Feb 1993.Google Scholar
- 13.E. G. J. M. H. NScker, J. g. W. Smetsers, M. C. J. D. van Eekelen, and M. J. Plasmeijer. Concurrent Clean. In E. H. L. Aarts, J. van Leeuwen, and M. Rein, editors, Parallel architectures and languages Europe (PARLE), LNCS 505/506, pages 202-220, Veldhoven, The Netherlands, Jun 1991. Springer-Verlag. Google ScholarDigital Library
- 14.W. Partain. The nofib benchmark suite of HaskelI programs (draft). Internal report, Dept. of Comp. Sci, Univ. of Glasgow, Scotland, Aug 1992.Google Scholar
- 15.S. L. Peyton Jones. The implementation of functional programming languages. Prentice Hall, Englewood Cliffs, New Jersey, 1987. Google ScholarDigital Library
- 16.M. J. Plasmeijer and M. C. J. D. van Eekelen. Functional programming and parallel graph rewriting. Addison Wesley, Reading, Massachusetts, 1993. Google ScholarDigital Library
- 17.C. Runciman and D. Wakeling. Heap profiling of lazy functional programs. Technical report 172, Dept. of Comp. Sci, Univ. of York, England, Apt 1992.Google Scholar
- 18.Q. F. Stout. Supporting divide-and-conquer algorithms for image processing. Journal parallel and distributed computing, 4(1):95-115, Feb 1987. Google ScholarDigital Library
- 19.D. A. Turner. Miranda: A non-strict functional language with polymorphic types. In J.-P. Jouannaud, editor, ~nd Functional programming languages and computer architecture, LNCS 201, pages 1-16, Nancy, France, Sep 1985. Springer-Verlag. Google ScholarDigital Library
- 20.D. A. Turner. Miranda system manual Research Software Ltd, 23 St Augustines Road, Canterbury, Kent CT1 1XP, England, Apr 1990.Google Scholar
- 21.M. C. J. D. van Eekelen, H. Huitema, E. G. J. M. H. NScker, J. E. W. Smetsers, and M. J. Plasmeijer. Concurent Clean language manual- version 0.8. Technical report 92-18, Dept. of Comp. Sci, Univ. of Nijmegen, The Netherlands, Aug 1992.Google Scholar
- 22.W. G. Vree. Design considerations for a parallel reduction machine. PhD thesis, Dept. of Comp. Sys, Univ. of Amsterdam, Dec 1989.Google Scholar
- 23.W. G. Vree and P. H. Haxtel. Fixed point computation for parallelism. Technical report CS-92-07, Dept. of Comp. Sys, Univ. of Amsterdam, Dec 1992.Google Scholar
- 24.P. L. Wadler. How to replace failure by a list of successes, a method for exception handling, backtracking, and pattern matching in lazy functional languages. In J.-P. Jouannaud, editor, 2nd Functional programming languages and computer architecture~ LNCS 201, pages 115-128, Nancy, France, Sup 1985. Springer-Verlag. Google Scholar
- 25.H. H. Wang. A parallel method for tri-diagonal equations. A CM transactions on mathematical software, 7(2):170-183, Jun 1981. Google ScholarDigital Library
Index Terms
- Benchmarking implementations of lazy functional languages
Recommendations
Side-effect localization for lazy, purely functional languages via aspects
Many side-effecting programming activities, such as profiling and tracing, can be formulated as crosscutting concerns and be framed as side-effecting aspects in the aspect-oriented programming paradigm. The benefit gained from this separation of ...
Thunk recycling for lazy functional languages: operational semantics and correctness
SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied ComputingLazy evaluation helps programmers write clear programs. However, it has significant run-time overheads for building many as-yet unevaluated expressions, or thunks. Because thunk allocation is a space-consuming task, it is important to reduce the number ...
The Generalized Intensional Transformation for Implementing Lazy Functional Languages
PADL 2013: Proceedings of the 15th International Symposium on Practical Aspects of Declarative Languages - Volume 7752The intensional transformation is a promising technique for implementing lazy functional languages based on a demand-driven execution model. Despite its theoretical elegance and its simple and efficient execution model, the intensional transformation ...
Comments