Set theoretic programming

From Wikipedia, the free encyclopedia

Set theoretic programming is a programming paradigm based on mathematical set theory. One example of a programming language based on this paradigm is SETL. The goal of set theoretic programming is to improve programmer speed and productivity significantly, and also enhance program clarity and readability.[1]

Languages With Set-Based Operators[edit]

References[edit]

  1. ^ J.T. Schwartz, R.B.K. Dewar, E. Dubinsky, and E. Schonberg. Programming with sets, an introduction to SETL. Springer-Verlag, 1986.