Skip to main content

Questions tagged [language-design]

For challenges asking participants to design a language or parts of a language, or tips questions about golfing language design.

Filter by
Sorted by
Tagged with
8 votes
0 answers
272 views

This was originally a pure mathematics question, but I think I've got the best chance for an answer here. The Challenge For concreteness, consider Peano Arithmetic (PA). For some language L of your ...
Charles Wang's user avatar
8 votes
5 answers
556 views

This is the robbers' challenge. To post a cop, go here. In this challenge, cops will invent a (likely simple) programming language, and write an interpreter, transpiler, or compiler that allows you to ...
rydwolf's user avatar
  • 19.3k
15 votes
9 answers
1k views

This is the cops' challenge. To post a robber, go here. In this challenge, cops will invent a (likely simple) programming language, and write an interpreter, transpiler, or compiler that allows you to ...
rydwolf's user avatar
  • 19.3k
10 votes
0 answers
379 views

Design a language and golf its interpreter so that it solves the following programming challenges in as few bytes as possible: Hello World cat Fizz Buzz List the first \$n\$ primes Fibonacci Sequence ...
Beefster's user avatar
  • 10k
51 votes
8 answers
7k views

The world is full of Turing-complete programming languages. Just about every useful language (and most useless ones) are Turing-complete. Some even became Turing-complete by accident. Often this is ...
Anders Kaseorg's user avatar
48 votes
15 answers
4k views

Creating a golfing language can be hard. Let's help budding golfing language creators out and provide some helpful tips on how to create one. I'm looking for tips on: The design process ...
lyxal's user avatar
  • 35.6k
8 votes
1 answer
566 views

This is a cops-and-robbers challenge based around defining languages and proving they are Turing complete. This is the robbers' thread. The cops' thread is here. Robbers The cops will post definitions ...
N. Virgo's user avatar
  • 7,446
15 votes
1 answer
1k views

This is a cops-and-robbers challenge based around defining languages and proving they are Turing complete. This is the cops' thread. The robbers' thread is here. Cops As a cop, you will prepare two ...
N. Virgo's user avatar
  • 7,446
38 votes
3 answers
2k views

A lot of PPCG users helped with the creation of this challenge, both in chat and the Sandbox, specifically Martin Ender, AdmBorkBork, Emigna and user202729 Our community has found it necessary to ...
caird coinheringaahing's user avatar
33 votes
3 answers
3k views

Notice: I'm willing to give a bounty to any answer that I find interesting. Your challenge is to design a Turing-complete one instruction set computer (OISC): An OISC is an abstract machine that ...
MD XF's user avatar
  • 14.3k
7 votes
0 answers
374 views

I majored in computer science in the area of communication technologies and I fluently speak Python, Java, C, Bash, Matlab, Octave and some others. But you guys know things I have never ever heard ...
Alon's user avatar
  • 235
11 votes
2 answers
520 views

Muriel is a language where the only way to loop is to create a quine and execute it. Your job is to create your own language with this property and an implementation of it in a pre-existing language. ...
Christopher King's user avatar
31 votes
1 answer
885 views

One of my favorite types of challenges on this site are restricted-source challenges. These challenges impose a computer tractable restriction that the sources of potential answers must pass. I like ...
Wheat Wizard's user avatar
  • 103k
18 votes
6 answers
943 views

I am writing a golfing language. Do you suggest variables, stack(s), tapes, registers, etc for storage in a code-golf language? What about implicit input? Rough definitions: A variable is simply a ...
user avatar
8 votes
0 answers
367 views

I am currently working on a golfing language. Do you have any suggestions for this language? What are some helpful features of a good golfing language? What features do you find useful? Do you suggest ...
user avatar
101 votes
10 answers
6k views

Determining whether a Language is Turing Complete is very important when designing a language. It is a also a pretty difficult task for a lot of esoteric programming languages to begin with, but lets ...
Wheat Wizard's user avatar
  • 103k
99 votes
15 answers
12k views

Robbers' challenge thread is here. Cops' challenge: Design a programming language that appears to be unusable for programming, but admits computation (or at least completion of the task) through some ...
feersum's user avatar
  • 31.8k
52 votes
6 answers
5k views

This is Fortnightly Challenge #6. Theme: Language Design There's a chatroom for this challenge. Come and join us if you want to discuss ideas! And now for something completely different... This ...
PhiNotPi's user avatar
  • 29.3k