LaToKi: A language toolkit for bottom-Up evaluation of functional programs

  • Peter Thiemann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 631)


LaToKi is a toolkit for experimentation with different implementations of recursion in strict functional programs. Its main emphasis is on the bottom-up evaluation of structural recursive denned programs. We have developed a technique that allows the evaluation of a wide subclass of structural recursive functions using a constant amount of control memory.


  1. 1.
    Herbert Klaeren and Klaus Indermark. Efficient implementation of an algebraic specification language. In M. Wirsing and J. A. Bergstra, editors, Algebraic Methods: Theory, Tools, and Applications, pages 69–90. Springer, 1987. LNCS 394.Google Scholar
  2. 2.
    Peter Thiemann. Efficient implementation of structural recursive programs. Technical Report WSI-91-12, Universität Tübingen, 1991.Google Scholar
  3. 3.
    Peter Thiemann. Konzepte zur effizienten Implementierung strukturell rekursiver Programme. Dissertation, Fakultät für Informatik, Universität Tübingen, 1991.Google Scholar
  4. 4.
    Peter Thiemann. Optimizing structural recursion in functional programs. In Proceedings International Conference on Computer Languages 1992, pages 76–85, April 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Peter Thiemann
    • 1
  1. 1.Wilhelm Schickard InstitutUniversität TübingenTübingenGermany

Personalised recommendations