Reusable Ada libraries supporting infinite data structures (1998)
by
Arthur G. Duncan
| Venue: | In Proceedings of the annual ACM SIGAda international conference on Ada |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Duncan98reusableada,
author = {Arthur G. Duncan},
title = {Reusable Ada libraries supporting infinite data structures},
booktitle = {In Proceedings of the annual ACM SIGAda international conference on Ada},
year = {1998},
pages = {89--103},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we describe a method, based on lazy evaluation, for creating infinite data structures in Ada. We illustrate some potential applications of infinite data structures and describe three different implementation approaches. 1.1 Keywords Ada, functional programming, lazy evaluation, infinite data structures. 2.
Citations
| 352 | ML for the Working Programmer - Paulson - 1996 |
| 297 | Pizza into java: Translating theory into practice - Odersky, Wadler - 1997 |
| 231 | The Standard Template Library - Stepanov, Lee - 482 |
| 194 | Revised5 report on the algorithmic language Scheme - Kelsey, Clinger, et al. - 1998 |
| 78 | CONS Should Not Evaluate its Arguments - Friedman, Wise - 1976 |
| 75 | Report on the programming language Haskell, version 1.2 - Hudak, Jones, et al. - 1992 |
| 73 | Jr., A lazy evaluator - Henderson, Morris - 1976 |
| 16 | Advanced functional programming - Hughes - 2005 |
| 5 | the Java-based Scheme system. v - Bothner |
| 5 | Implementing the C++ Standard Template Library in Ada 95 - Erlingsson, Konstantinou - 1996 |
| 5 | Ada Generic - Musser, Stepanov - 1989 |
| 4 | Ada 95: the craft of object-oriented programming - English - 1997 |
| 4 | Abstract data types are under full control with Ada 9X - Kempe - 1994 |
| 1 | Experience and Suggestions on Using Ada to Implement Internal Program Representations - Duncan - 1990 |
