PAL (programming language)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

PAL, the Pedagogic Algorithmic Language, is a programming language developed at the Massachusetts Institute of Technology in around 1967 to help teach programming language semantics and design.[1][2] It is a "direct descendant" of ISWIM and owes much of its philosophy to Christopher Strachey.[3]

The initial implementation of PAL, in Lisp, was written by Peter Landin and James H. Morris, Jr. It was later redesigned by Martin Richards, Thomas J. Barkalow, Arthur Evans, Jr., Robert M. Graham, James Morris, and John Wozencraft. It was implemented by Richards and Barkalow in BCPL as an intermediate-code interpreter and ran on the IBM System/360; this was called PAL/360.[4]

RPAL[edit]

RPAL, the Right-reference Pedagogic Algorithmic Language, is a functional subset of PAL with an implementation on SourceForge.[5] It is used at the University of Florida to teach the construction of programming languages and functional programming. Programs are strictly functional, with no sequence or assignment operations.

References[edit]

  1. ^ Arthur Evans, Jr., PAL: Pedagogic Algorithmic Language: A Reference Manual and Primer. Unpublished report, Department of Electrical Engineering, MIT, February 1970.
  2. ^ John M. Wozencraft and Arthur Evans, Jr. Notes on Programming Linguistics. Unpublished report, Department of Electrical Engineering, MIT. February, 1971.
  3. ^ Arthur Evans, Jr., "PAL—a language designed for teaching programming linguistics" Proceedings of the 1968 23rd ACM National Conference (August 27–29, 1968), p. 395-403 ACM abstract
  4. ^ "PAL (Pedagogic Algorithmic Language)". Computer History Museum/Software Preservation Group.
  5. ^ "RPAL - The Right-reference Pedagogic Algorithmic Language". SourceForge.