A couple of days ago I wondered how many authors (except for me) write problems about programming languages. I was hoping to be not alone in my passion to this topic; but the reality exceeded all expectations. Of course, problems which feature programming languages are much scarcer than ones about computers, processors, microchips, parallel computing, databases and other IT things, but still much more frequent than ones about, say, dragons :-)

1. TopCoder

The early years of TopCoder presented the participants with several programming-languages-featuring problems. Most of them (7/9) are pretty similar: given the source code written in C- or Pascal-like language, analyze it and report the result.

It's hard to say why the flow of such problems trickled away in the last years. I can suggest several versions:

• the change of Algorithms coordinator (or his aesthetic preferences).
• the lack of interest among authors. It's much easier to invent a problem about something abstract instead of following a certain topic, especially this one.
• the tasks focus on algorithmic aspects of the problem instead of a lengthy and unexciting implementation.
• the platform limits expressive means of the problems; for example, if the problem asks to generate a piece of code instead of analyzing the given one, it becomes harder immediately. TopCoder testing system disallows to process the return value (interpret the returned program and compare its behavior with the requirements), so the answer must be unique to be compared with a reference one. And this means that the problem requires additional limitations — the return must be the shortest possible, lexicographically earliest if several of the same length are possible etc. Finding an algorithm which minimizes the length of the generated code and proving its correctness is hardly a suitable task for a single SRM :-)
• if the problem asks to generate a program which does something, this something must be described with input parameters in a proper way (that is, there should be a lot of input datasets differing in a non-trivial way). Off the top of my head I can think of "output the given message" and "calculates the given arithmetic expression" — both not exactly thrilling.

2. Codeforces

On Codeforces the things are pretty good, especially given that the site is much younger than the other ones mentioned in this article. Besides my (round #96)[http://codeforces.net/blog/entry/3302], there are problems 93C - Azembler (generate a program in Assembler-like language) and 39A - C*++ Calculations (about increment operators a++ and ++a). Generally this will come with time — the system allows to make the problems diverse enough, so new themed problems are a matter of authors' ingenuity.

P.S. And this point gets immediate support from today's round: 195C - Try and Catch is based on exceptions handling in Vasya Programming Language :-)

3. Challenge24

I've already mentioned that I love this competition, haven't I? Well, I'm going to repeat this again: I really like Challenge24, not least because of the topics and problems diversity. In the last four years either the finals or the electronic contest include a problem which asks the teams to write programs in some weird language or at least interpret the given ones.

Note that this format suits Challenge24 nearly perfectly. First, it differs a lot from the typical contest tasks, so Algorithm reds have smaller advantage on it (I can't really imagine a format which would give them no advantage at all). Second, it implements two principles of Challenge24: first (small) test cases can be solved by hand while the larger ones require some automation, and different submissions can be compared by "quality" (the length of generated code), thus enabling relative scoring. Finally, the timing and the teaming of the contest allows to set problems which require writing an interpreter before starting the actual programs.

4. IPSC

Another contest which doesn't limit the authors' creativity by the format: each problem needs only two tests (subtasks), and they may differ a lot (unlike Challenge24 in which the tests for the problem vary in size and complexity but not meaning). Therefore each year of the competition (alas, except for the last one) has a fancy problem featuring a programming language of some kind, either in the main contest or in practice one.

5. Other sources

There is good reason to believe that various ACM-contests use programming-languages-based problems as well, and some digging through archives will reveal a lot of interesting cases.

• The first glance at acm.timus.ru shows us tag "unusual problems" and a problem Introspective Program which asks to write a quine in a mysterious language PIBAS...
• ...and Language Ocean from eastern subregional of NEERC 2011 which requires to implement types inference and check of types validity...
• ...and Time Limit Exceeded which makes you interpret the given program and terminate it mercilessly after only ten million commands...
• ...and Brainfuck which asks to generate the shortest program in a version of Brainfuck without loops.
• A series of problems from Ural State University introduces the participant with D++ language (nothing in common with Meta D++, or DigiSystems D++, or D++ for distributed calculations).
• More examples given in post comments in Russian interface.

And what problems about programming languages do you know?