skip to main content
10.1145/255471.255514acmconferencesArticle/Chapter ViewAbstractPublication PagesadaConference Proceedingsconference-collections
Article
Free Access

DAda—an Ada preprocessor for functional programming

Authors Info & Claims
Published:01 December 1990Publication History

ABSTRACT

The impact of declarative (functional) programming is inhibited by the need to learn/use new languages. A series of language extensions implemented by preprocessing, which integrates functional programming into the Ada culture, is described. Features include lazy streams, recursive data structures, the abolition of assignment and its replacement by data-flow control constructs.

References

  1. 1.ANSI, "Reference Manual for the Ada Programming Language", ANSI/MIL-STD 1815A, U.S. Dept. of Defense, 1983.Google ScholarGoogle Scholar
  2. 2.Bird, R. and Wadler, P., "Introduction to Functional Programming", Prentice-Hall International, London, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Hayes, I.J. (ed.), "Specification Case Studies", Prentice-Hall, London, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Budde, R., Kuhlenkampe, K., Mathussen, L. and Zullighoven, H. (eds.), "Approaches to Prototyping", Springer, Berlin, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Turner, D.A., "Miranda - a non-strict functional language with polymorphic types", in Jouannaud (ed.), Conference of Functional Programming Languages and Comptuer Architecture, Lecture Notes in Computer Science, vol. 201, pp. 1-16, Springer, Berlin, 1985. Google ScholarGoogle Scholar
  6. 6.Bailes, P.A., Johnston, D.B. and Salzman, E.J., "A Proposal for a Genuinely-Lazy Streams Facility for Ada", Journal of Computer Languages, to appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Bailes, P.A., "Extending Ada Streams for Input-Output", University of Qeeensland Department of Computer Science Technical Report 146, Brisbane, 1990.Google ScholarGoogle Scholar
  8. 8.Ackerman, W.B., "Data Flow Languages", Proc. Nat. Comput. Conf., pp. 1087-1095. 1979.Google ScholarGoogle Scholar
  9. 9.Landin, P.J., "A Correspondence Between ALGOL 60 and Church's Lambda-Notation: Part I", CACM, vol. 8, no. 2, pp. 89-101, 1965. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Henderson, P. and Morris, J.H., "A Lazy Evaluator", Proc. 3rd. ACM Symposium on Principles of Programming Languages, pp. 95-103, 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Bailes, P.A., "Evaluating the Ada-Streams Facility", University of Queensland Department of Computer Science Technical Report 147, Brisbane, 1990.Google ScholarGoogle Scholar
  12. 12.Bailes, P.A., Johnston, D.B. and Wang, L., "Implementing Conceptually-Efficient Ada-Streams", University of Queensland Department of Computer Science Technical Report 159, Brisbane, 1990.Google ScholarGoogle Scholar
  13. 13.Bailes, P.A. and Salzman, E.J., "DM2 - A Declarative Dialect of Modula-2 for Rapid Prototyping", University of Queensland Department of Computer Science Technical Report 91, Brisbane, 1988.Google ScholarGoogle Scholar
  14. 14.Donaldson, C.N., "Dynamic Binding and Inheritance in an Object-Oriented Ada Design", Proceedings of the Ada-Europe Conference 1989, pp. 16-25, Cambridge University Press, Cambridge 1989.Google ScholarGoogle Scholar
  1. DAda—an Ada preprocessor for functional programming

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      TRI-Ada '90: Proceedings of the conference on TRI-ADA '90
      December 1990
      630 pages
      ISBN:0897914090
      DOI:10.1145/255471

      Copyright © 1990 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 December 1990

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader