Hamming numbers, lazy evaluation, and eager disposal

  title={Hamming numbers, lazy evaluation, and eager disposal},
  author={C. K. Yuen},
  journal={ACM SIGPLAN Notices},
  • C. Yuen
  • Published 1 August 1992
  • Computer Science
  • ACM SIGPLAN Notices
The generation of Hamming numbers is used as a case study for discussing storage management for transient data structures in language processors. 

Compilation of bottom-up evaluation for a pure logic programming language

A top-up evaluation technique which is optimised for Starlog programs, a static indexing structure that allows significant compile time optimisation, an intermediate language to represent bottom-up logic programs and an evaluation of automatic data structure selection techniques are described.

Efficient Goal Directed Bottom-up Evaluation of Logic Programs

Stream Differential Equations: Specification Formats and Solution Methods

This paper describes in detail the connection between the so-called syntactic solution method and abstract GSOS and classification of different formats of stream differential equations, their solution methods, and the classes of streams they can define.



Parallel LISP Systems: A Study of Languages and Architectures

Lisp: history and background, programming in Lisp, implementation methods, current developments.

A transputer-based parallel Lisp implementation

The effort made to implement BaLinda Lisp, a parallel Lisp dialect, on transputer arrays is reported, demonstrating that the interpreter achieves realistic parallelism and provides a high speed symbolic processing environment on transputers.

Which model of programming for LISP: sequential, functional or mixed?

It is argued that both the sequential model and the functional model have developed in directions of excessive complexity, and a mixed model based on old-style Lisp, but augmented with new parallel constructs, can provide a simpler tool for handling practical programming tasks.

I-structures: data structures for parallel computing

It is difficult to achieve elegance, efficiency, and parallelism simultaneously in functional programs that manipulate large data structures, and it is shown that even in the context of purely functional languages, I-structures are invaluable for implementing functional data abstractions.

Elements of functional programming

  • C. Reade
  • Computer Science
    International computer science series
  • 1989
This chapter discusses functional programming concepts, implementation techniques, and how to extend functional methods through type checking and type Inference.

Introduction to functional programming

  • R. BirdP. Wadler
  • Economics
    Prentice Hall International series in computer science
  • 1988
This is a thorough introduction to the fundamental concepts of functional programming that includes a simple, yet coherent treatment of the Haskell class; a calculus of time complexity; and new coverage of monadic input-output.

Functional programs as executable specifications

machine (ABC-code)

Functional programs as executable specifications

  • D. Turner
  • Computer Science
    Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
  • 1984
A functional programming language with these properties is presented and its use as a specification tool is demonstrated on a series of examples.

Structure and Interpretation of Computer Programs

Structure and Interpretation of Computer Programs emphasizes the central role played by different approaches to dealing with time in computational models, appropriate for an introduction to computer science courses, as well as programming languages and program design.

Functional programming - practice and theory

It's significant to wait for the representative and beneficial books to read to find the feeling to read this book when you find it.