Category:Tailspin
This programming language may be used to instruct a computer to perform a task.
Official website 

Lang tag(s):  tailspin 

See Also: 

If you know Tailspin, please write code for some of the tasks not implemented in Tailspin.
Tailspin simplifies data transfer and the processing of data according to rules and conditions. Thanks to its declarative data structures and corresponding condition matching syntax, many algorithms look exactly like the specification, for example, compare the json parser and the json specification.
Despite the grounding in business data processing, Tailspin turns out to be fun to use and has been used for the adventofcode events of 2018 , 2019 and 2020
The inspiration comes mostly from xslt, but data structures are jsonlike. The main idea is to let your data flow through a series of transforms so it should be easy to specify that flow. Transform steps can be specified as a set of templates with patternmatching determining which template to apply. Output is generally specified as literals with interpolation of values.
Development page, also how to run Tailspin programs on github
Pages in category "Tailspin"
The following 94 pages are in this category, out of 94 total.
A
C
F
J
L
M
R
S
 Sequence of primes by trial division
 Set puzzle
 Sieve of Eratosthenes
 Solve a Hidato puzzle
 Sorting algorithms/Bubble sort
 Sorting algorithms/Merge sort
 Sorting algorithms/Pancake sort
 Sorting algorithms/Quicksort
 Sorting algorithms/Radix sort
 Split a character string based on change of character
 Stack
 String comparison
 String concatenation
 String interpolation (included)
 String matching
 Substring
 Sudoku
 Sum of squares