Set theoretic programming
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
- Bandicoot
- Claire
- LINQ - Extensions to .NET languages such as C#, F#, and VB.NET
- Matlab
- Miranda
- SQL
- SETL
gollark: Also, speaking of the zero width character thing, if you did also want transferable-through-screenshot information too, and had control of the display of the text in question, you could probably also vary the colors of each character very slightly or overlay nearly-invisible-but-technically-there QR-code-type things.
gollark: Until you want to use highly advanced concepts like "lists of multiple items".
gollark: The spec is overcomplicated, it's insecure by default in parser libraries, and there are something like 9 ways to write multiline strings.
gollark: "Basic text" has to be in *some format*.
gollark: Yes. YAML is quite bad.
References
- J.T. Schwartz, R.B.K. Dewar, E. Dubinsky, and E. Schonberg. Programming with sets, an introduction to SETL. Springer-Verlag, 1986.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.