We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
DIVSPL
Jump to navigation
Jump to search
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.
| Paradigm(s) | declarative |
|---|---|
| Designed by | Dustin Ingram |
| Appeared in | 2016 |
| Type system | static, strong |
| Dimensions | one-dimensional |
| Computational class | total |
| Reference implementation | [1] |
| File extension(s) | .divspl |
Dustin Ingram's Very Special Programming Language, or DIVSPL, is a declarative wikipedia:domain-specific language for solving the FizzBuzz problem.
Examples
The original FizzBuzz problem can be expressed in DIVSPL as:
1...15 fizz=3 buzz=5
Using the conventions on the FizzBuzz page:
1...15 Fizz=3 Buzz=5
The author's motivation was to make the following example easy to express:
1...105 fizz=3 buzz=5 fuzz=7
An example by PSTF which counts for every multiples of primes under 20.
1...999 Dui=2 Tri=3 Quinqui=5 Septi=7 Undeci=11 Trideci=13 Septideci=17 Nonadeci=19
Implementations
- Dustin Ingram's implementation in RPython
- Corbin has written two versions: v0 in Python 3 and v1 in RPython