Best Showcase of a New Language
This is for new languages (golfing or otherwise) created in or after December 2016 (meaning, the first commit on GitHub or the like was from that date). The category is designed to highlight the answer that best shows the features, tricks, and benefits of using this new language. The author of the answer does not necessarily need to have been the author of the language.
Answers from "Showcase your language" or tips challenges are ineligible.
BitCycle is a low-level 2D language that works by moving bits around on a playfield. (Think of it as the lovechild of ><> and Bitwise Cyclic Tag.) Even though the only tools it has for computation are 0's, 1's, and some queues for storage, it is Turing-complete.
This answer shows off nearly all of BitCycle's features and performs an integer-arithmetic task in a language that doesn't even have integers. It comes with a GIF showing the ungolfed version in action, plus a point-by-point explanation.
nominated by Heeby Jeeby Man
Klein is a language about topology and no answer shows off the mind bending nature of Klein better than this answer. In this answer 0 ' makes a polyglot that runs in all of the Kleins 12 topologies and prints a different result in each. With its excellent explanation this answer provides a full showcase of what Klein does.
;#+ is a language designed to redeem the relatively uninteresting language ;#. This specific answer highlights the unconventional nature of the language, showing that the shortest approach is not like a Brainf*** or similar esoteric answer, for it outgolfs the first ;#+ answer here. The answer serves as a general guide as to how to write tersely in the language, showing off most of its programmatic features in a simple way. The answer explains itself well, and summarizes ;#+ pithily.
Add++ is a language that started as not very complex, using a single accumulator, and eventually evolving into a language with functions and complex structures. This answer is the first that demonstrates usage of all three memory systems Add++ has to offer and is a good example of how to switch between functions and accumulator coding in Add++.
Alice is a feature-rich 2D language (of the Fungeoid family), which has a ton of built-ins, and either uses string manipulation commands or arithmetic commands, depending on which direction the instruction pointer is moving in. This is one of the most complex programs that has been written and golfed in Alice at this point, and it shows off the benefit of mixing both Cardinal (integer) and Ordinal (string) mode in a single program to get things done. The answer also shows off the usefulness of Alice's somewhat seemingly random built-ins (e.g. "divide all factors less than k out of n") and how to build interesting nested loops with Alice's control flow commands. I personally also really like the neatness of how the four short Ordinal sections interleave perfectly in the layout without wasting any bytes (which is a big part of golfing any Alice program that makes nontrivial use of both modes).
Husk is a pure functional golfing language created in 2017 by PPCG users Zgarb and Leo.
This answer highlights two of the distinctive features of Husk golfing: casual handling of infinite lists (as produced by
¡ and then chopped by
U) and abuse of higher-order functions by giving them arguments that defy the "intended" semantics (like
ü is supposed to remove duplicates based on a binary equality predicate).
Even with the intended semantics,
ü is arguably a weird built-in; Husk has lots of similar higher-order functions.