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: I'm thinking about restructuring minoteaur because neatly structuring projects is hard.
gollark: We need to make a third definition to confuse everyone.
gollark: That sounds REALLY BORING.
gollark: i am very
gollark: Why not? They aren't viros.
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.