Skip to main content
×
×
Home

The interactive Lazy ML system

  • Lennart Augustsson (a1)
Abstract

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.

Copyright
References
Hide All
Appel, W. and MacQueen, D. B. 1987. A standard ML compiler. In Proc. Functional Programming Languages and computer Architecture, pp. 301324. Volume 274 of Lecture Notes in Computer Science. Springer-Verlag.
Augustsson, L. 1985. SMALL, a small interactive functional system. PMG Report 28, Department of Computer Sciences, Chalmers University of Technology (09).
Augustsson, L. 1987. Compiling Lazy functional Languages, Part II. PhD thesis, Department of Computer Science, Chalmers University of Technology (11).
Augustsson, L. 1989. Functional I/O Using System Tokens. PMG Memo 72, Department of Computer Sciences, Chalmers University of Technology.
Augustsson, L. and Johnsson, T. 1989. The Chalmers Lazy-ML compiler. The Computer Journal 32 (2): 127141.
Hudak, P. et al. 1992 Report on the Functional Programming Language Haskell, Version 1.2 (03).
Johnson, S. C. 1975. Yacc – Yet Another Compiler Compiler. Technical Report 32, Bell Labs. (Also in UNIX Programmer's Manual, Volume 2B.)
Johnsson, T. 1984. Efficient compilation of lazy evaluation. In Proc. SIGPLAN Symp. on Compiler Construction. pp. 5869, Montreal.
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.
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.
Johnsson, T. 1987. Compiling Lazy Functional Languages. Ph.D. thesis, Department of Computer Sciences, Chalmers University of Technology (02).
Milner, R. 1978. A theory of type polymorphism in programming. J. Computer and Systems Sciences, 17: 348375.
Milner, R., Tofte, M. and Harper, R. 1990. The Definition of Standard ML. MIT Press.
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).
Steele, G. L. 1984. Common LISP – the language. Digital Press.
Turner, D. A. 1979. A new implementation technique for applicative languages. Software – Practice and Experience, 9: 3149.
Turner, D. A. 1985. Miranda: A non-strict language with polymorphic types. In Proc. Conf. on Functional Programming Languages and Computer Architecture, pp. 116.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

The interactive Lazy ML system

  • Lennart Augustsson (a1)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *