A Caltech Library Service

Using Logic Programming for Compiling APL


Derby, Howard (1984) Using Logic Programming for Compiling APL. Master's thesis, California Institute of Technology. doi:10.7907/gmjh-z702.


APL is a dynamically typed language which deals with arrays whose type, number of dimensions (rank) and size are not fixed at compile time, but are instead determined at run time. This makes APL more difficult to compile than static languages like Pascal or FORTRAN. This thesis describes a prototype implementation of the core of an APL compiler. The intention thus far has been to demonstrate techniques for dealing with some of the issues that arise when trying to implement APL efficiently, rather than to produce a working implementation. The present program does not do any of the initial lexical processing required, and only compiles into intermediate code. Object code is never produced. The prototype has many APL features missing and is undoubtedly full of bugs.

Item Type:Thesis (Master's thesis)
Subject Keywords:Computer Science
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Computer Science
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Unknown, Unknown
Thesis Committee:
  • Unknown, Unknown
Defense Date:1 March 1984
Other Numbering System:
Other Numbering System NameOther Numbering System ID
Computer Science Technical Reports5134-TR-84
Record Number:CaltechTHESIS:04092012-134858703
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:6897
Deposited By: Benjamin Perez
Deposited On:09 Apr 2012 21:46
Last Modified:11 Aug 2022 17:45

Thesis Files

PDF - Final Version
See Usage Policy.


Repository Staff Only: item control page