Browsing by Author "Anthony H Dekker"

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    Bohm Tree for the Lazy Lambda Calculus with Constants
    (1994-08-01T00:00:00Z) Anthony H Dekker
    In this paper we present a Boehm Tree model for the Lazy Lambda Calculus with constants, which extends Abramsky's pure Lazy Lambda Calculus. The Lazy Lambda Calculus with constants forms a basis for modern lazy functional programming languages, which usually provide a call-by-value facility which is able to distinguish between the values _|_ and \x._|_, as well as providing strict arithmetic primitives. The Boehm Tree model we present also acts as an improved model for the pure Lazy Lambda Calculus. In addition, the paper provides a framework for studies of Boehm Trees in more general systems.
  • No Thumbnail Available
    Item
    The Game of Life : A CLEAN Programming Tutorial and Case Study
    (1994-05-01T00:00:00Z) Anthony H Dekker
    This report presents a tutorial for the CLEAN Functional Programming Language, in the form of a stepwise development of two programs for animating Conway's Game of Life. The power of the novel and elegant input/output and Graphical User Interface (GUI) facilities of CLEAN are demonstrated by this example, which contains most of the features required in useful applications software. Suggestions on suitable programming style are also included. The file TRB5-94.pdf contains the report, while the file TRB5-94.extras.uu contains the full set of programs described (tar'ed, compressed, uuencoded).
  • No Thumbnail Available
    Item
    The Lazy Lambda Calculus with Constants
    (1994-07-01T00:00:00Z) Anthony H Dekker
    In this paper we define the Lazy Lambda Calculus with constants, which extends Abramsky's pure lazy Lambda Calculus. This calculus forms a model for modern lazy functional programming languages. Such languages usually provide a call-by-value facility which is able to distinguish between the values _|_ and \x._|_. We study the operational and denotational semantics of this calculus both with and without a superimposed type inference system. Finally we compare the operational and denotational semantics, and give a limited full-abstraction result based on that of Plotkin.