Logic programming in APL2

  • Authors:
  • James A. Brown;Janice H. Cook;Leo H. Groner;Ed Eusebi

  • Affiliations:
  • IBM Santa Teresa Lab J88/E42, 555 Bailey Ave., P.O. Box 50020, San Jose, Calif.;IBM Santa Teresa Lab J88/E42, 555 Bailey Ave., P.O. Box 50020, San Jose, Calif.;IBM Santa Teresa Lab J88/E42, 555 Bailey Ave., P.O. Box 50020, San Jose, Calif.;IBM Santa Teresa Lab J88/E42, 555 Bailey Ave., P.O. Box 50020, San Jose, Calif.

  • Venue:
  • APL '86 Proceedings of the international conference on APL
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

The most popular vehicles for logic programming are LISP and PROLOG. APL2 has the important features of these languages and more. On one hand, APL2 has all the expressive power of LISP and implementation of PROLOG in APL2 is not difficult. On the other hand, APL2 includes facilities for full screen management, menus, graphics, access to relational databases, and powerful computational primitives.This paper explores the representation of logic using the nested data structures of APL2 and shows how some standard algorithms of logic programming are expressed in APL2. This includes Unification, Resolution, and a logic programming environment like PROLOG. A discussion of the pertinent APL2 notation, detailed discussion of the algorithms and commented programs appear in (Br1).