Hostname: page-component-6766d58669-kl59c Total loading time: 0 Render date: 2026-05-14T12:14:10.212Z Has data issue: false hasContentIssue false
  • English
  • Français

The interactive Lazy ML system

Published online by Cambridge University Press:  07 November 2008

Lennart Augustsson
Lennart Augustsson
Affiliation:
Department of Computer Sciences, Chalmers University of Technology, S-412 96 Goteborg, Sweden (e-mail: augustss@cs.chalmers.se)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we describe an implementation of an interactive version of the purely functional programming language Lazy ML (LML). The most remarkable fact about the interactive system is that it is written in a pure functional style using LML, yet the efficiency still compares favourably to other conventional interpretative systems.

We describe how the system is designed, and also the exception mechanism that was added to facilitate the handling of errors in the system.

Information

Type
Research Article
Information
Journal of Functional Programming , Volume 3 , Issue 1 , January 1993 , pp. 77 - 92
Copyright
Copyright © Cambridge University Press 1993

References

Appel, W. and MacQueen, D. B. 1987. A standard ML compiler. In Proc. Functional Programming Languages and computer Architecture, pp. 301–324. Volume 274 of Lecture Notes in Computer Science. Springer-Verlag.CrossRefGoogle Scholar
Augustsson, L. 1985. SMALL, a small interactive functional system. PMG Report 28, Department of Computer Sciences, Chalmers University of Technology (09).Google Scholar
Augustsson, L. 1987. Compiling Lazy functional Languages, Part II. PhD thesis, Department of Computer Science, Chalmers University of Technology (11).Google Scholar
Augustsson, L. 1989. Functional I/O Using System Tokens. PMG Memo 72, Department of Computer Sciences, Chalmers University of Technology.Google Scholar
Augustsson, L. and Johnsson, T. 1989. The Chalmers Lazy-ML compiler. The Computer Journal 32 (2): 127–141.CrossRefGoogle Scholar
Hudak, P. et al. 1992 Report on the Functional Programming Language Haskell, Version 1.2 (03).Google Scholar
Johnson, S. C. 1975. Yacc – Yet Another Compiler Compiler. Technical Report 32, Bell Labs. (Also in UNIX Programmer's Manual, Volume 2B.)Google Scholar
Johnsson, T. 1984. Efficient compilation of lazy evaluation. In Proc. SIGPLAN Symp. on Compiler Construction. pp. 58–69, Montreal.Google Scholar
Johnsson, T. 1985. Lambda lifting: transforming programs to recursive equations. In Proc. Conf. on Functional Programming Languages and Computer Architecture. Vol 201 of Lecture Notes in Computer Science. Springer-Verlag.Google Scholar
Johnsson, T. 1986. Code generation from G-machine code. In Proc. Workshop on Graph Reduction. vol. 279 of Lecture Notes in Computer Science. Springer-Verlag.Google Scholar
Johnsson, T. 1987. Compiling Lazy Functional Languages. Ph.D. thesis, Department of Computer Sciences, Chalmers University of Technology (02).Google Scholar
Milner, R. 1978. A theory of type polymorphism in programming. J. Computer and Systems Sciences, 17: 348–375.CrossRefGoogle Scholar
Milner, R., Tofte, M. and Harper, R. 1990. The Definition of Standard ML. MIT Press.Google Scholar
Reeves, A. C., Harrison, D. A., Sinclair, A. F. and Williamson, P. 1989. Gerald: an exceptional lazy functional programming language. In Davis, K. and J., Hughes (editors), Functional Programming: Proceedings of the 1989 Glasgow Workshop, Fraserburgh, Scotland (08).Google Scholar
Steele, G. L. 1984. Common LISP – the language. Digital Press.Google Scholar
Turner, D. A. 1979. A new implementation technique for applicative languages. Software – Practice and Experience, 9: 31–49.CrossRefGoogle Scholar
Turner, D. A. 1985. Miranda: A non-strict language with polymorphic types. In Proc. Conf. on Functional Programming Languages and Computer Architecture, pp. 1–16.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.