Generic functions by nonstandard name scoping in APL

Authors:
James T. Kajiya
Affiliations:
Computer Science Department, California Institute of Technology, Pasadena, California
Venue:
APL '81 Proceedings of the international conference on APL
Year:
1981

Citing 9
Cited 4

An Algorithmic Semantics for ALGOL 60 Identifier Denotation

Journal of the ACM (JACM)
Recursive data structures in APL

Communications of the ACM
Capability-based addressing

Communications of the ACM
The Smalltalk-76 programming system design and implementation

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Anatomy of LISP

Anatomy of LISP
Name scope control in APL defined functions

ACM SIGAPL APL Quote Quad
Control structure aptness: A case study using top-down parsing

ICSE '78 Proceedings of the 3rd international conference on Software engineering
Proposal for a complex APL

APL '79 Proceedings of the international conference on APL: part 1
Data structure models for programming languages

ACM SIGPLAN Notices

Implicit instead of the explicit copy command

ACM SIGAPL APL Quote Quad
Function and context

APL '83 Proceedings of the international conference on APL
Designing and implementing an array theory incorporating abstract datatypes

APL '83 Proceedings of the international conference on APL
A survey of extensions to APL

APL '82 Proceedings of the international conference on APL

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to acheive generic functions as in abstract datatypes (such as the Simula CLASS construct or ADA Package notion) for typeless languages, specifically APL. We do this by altering the standard dynamic scoping of names in APL to a scheme we call downward scoping.