This paper has been translated from "L'implantation de fonctions pour les ensembles en APL (une proposition)" ( Les Nouvelles d'APL, No. 22, Mars 1997, pp. 81-86).Proposals are formulated for the implementation of the primitive set functions: unique, union, intersection, and difference. User-defined functions are given, simulating those proposed primitive functions, illustrated with some examples.In a note added to a letter to the editor, published in Les Nouvelles d'APL 1, it emphasizes the need to extend APL with primitive functions for handling sets. Definitions are proposed in this paper for such primitives: the monadic function unique and the dyadic functions union, intersection, and difference. User defined functions are given which are equivalent to those proposed primitives, illustrated with some examples. Concepts are based on those described by D. Livingstone and by the authors referenced in his paper 2. The number of occurrences of the items in the results are adapted to the needs imposed by handling Relational Database Algebra 2.
/lp/association-for-computing-machinery/the-implementation-of-set-functions-in-apl-a-proposal-OY92V6jSva