skip to main content
article
Free Access

CONVERT

Published:01 August 1966Publication History
Skip Abstract Section

Abstract

A programming language is described which is applicable to problems conveniently described by transformation rules. By this is meant that patterns may be prescribed, each being associated with a skeleton, so that a series of such pairs may be searched until a pattern is found which matches an expression to be transformed. The conditions for a match are governed by a code which also allows subexpressions to be identified and eventually substituted into the corresponding skeleton. The primitive patterns and primitive skeletons are described, as well as the principles which allow their elaboration into more complicated patterns and skeletons. The advantages of the language are that it allows one to apply transformation rules to lists and arrays as easily as strings, that both patterns and skeletons may be defined recursively, and that as a consequence programs may be stated quite concisely.

References

  1. 1 McCARTHY, J. Recursive functions of symbolic expressions and their computation by machine. Comm. ACM 8, 4 (1960), 184-195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 --, ET aL. LISP 1.5 Programmer's Manual. MIT, Cambridge, Mass., 1962. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 BERKELEY, E. C., AND BOBROW, D. G. (Eds.) The Programmint Language LISP, its Operation and Application. Information International Inc., Cambridge, Mass., 1964.Google ScholarGoogle Scholar
  4. 4 YNGVE, V. H., ET AL. An Introduction to COMIT Programming. The MIT Press, Cambridge, Mass., 1963.Google ScholarGoogle Scholar
  5. 5 GUZMAN, A. CONVERT. Professional Thesis (Spanish), Instituto Politecnico National, Mexico City, 1965.Google ScholarGoogle Scholar

Index Terms

  1. CONVERT
    Index terms have been assigned to the content through auto-classification.

    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

    Full Access

    • Published in

      cover image Communications of the ACM
      Communications of the ACM  Volume 9, Issue 8
      Aug. 1966
      114 pages
      ISSN:0001-0782
      EISSN:1557-7317
      DOI:10.1145/365758
      Issue’s Table of Contents

      Copyright © 1966 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 August 1966

      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