SETL has an interesting lineage and part to play in the history of computing:

The original SETL was implemented in a language known as LITTLE, Dave Shields noted in an email: "SETL was implemented in LITTLE, a language based on FORTRAN that had fixed=length bitfields as a fundamental data type."

Early SETL was used by Robert Dewar's team to implement the first validated Ada implementation, known as NYU Ada/Ed. This implementation worked as an interpreter.

We have a printed copy of the original SETL based NYU Ada/Ed but we are still to find the original SETL implementation. Maybe somewhere in the Courant Institute or their alumni there is someone with an original magnetic tape from the DEC VAX machine that ran these implementations.