Set theoretic programming: Difference between revisions
Jump to navigation
Jump to search
imported>Citation bot Misc citation tidying. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_CommandLine |
|||
| Line 13: | Line 13: | ||
{{reflist}} | {{reflist}} | ||
{{Programming paradigms navbox}} | |||
{{DEFAULTSORT:Set Theoretic Programming}} | {{DEFAULTSORT:Set Theoretic Programming}} | ||
[[Category:Programming paradigms]] | [[Category:Programming paradigms]] | ||
Latest revision as of 02:00, 1 January 2026
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
References
<templatestyles src="Reflist/styles.css" />
- ↑ J.T. Schwartz, R.B.K. Dewar, E. Dubinsky, and E. Schonberg. Programming with sets, an introduction to SETL. Springer-Verlag, 1986.
Script error: No such module "Check for unknown parameters".
Template:Programming paradigms navbox
- REDIRECT Template:Prog-lang-stub