A Chrestomathy of Obscurity You should complete four tasks in a language which:


must return no results* when searched for on this (codegolf.se) website, for example ToffeeScript;
must have a page listed at Esolang, Rosetta Code or Wikipedia;
be a distinct language, rather than a distinct version (e.g. python 2.1 would be valid iff python satisfied the first two criteria).


*The exception being this hit for ToffeeScript.

The four tasks you should complete are:

1) Write a tweetable (&lt;140 characters) description/promotion of your chosen language.

2) Print "Hello World! This is written in &lt;programming language name&gt;."

3) Print all the odd numbers in a user specified range. (e.g. a stdin of 20 25 should return 21 23 25).

4) Write a program which you feel best demonstrates an interesting feature of your chosen language.

Scoring:


This is a popularity contest
Bonus of 10 points if listed in two of the above directories, 25 if in all three.
Score is the summation of votes received at midnight UTC on July 1 2015, plus the bonuses. 


Clarifications:


Task 1) can be a tweetable program but plain text is also acceptable.
Many languages do not have an existing interpreter; solutions to these are fine, but will be taken in good faith.
The second criterion for language choice forbids pages whose creation dates after this post. If, for a given language, X, a solution to a problem exists on Rosetta Code but it does not have a distinct page of its own somewhere, it is still acceptable.
BlooP

Bonus: 10

There are pages for BlooP on Esolangs and Wikipedia. A PPCG search for BlooP returns no results. If you're feeling particularly loopy, you can try it out on repl.it.



Task 1: The Tweet


  BlooP: Nothing but bounded loops. ;) #programming #goodtimes


This uses standard Twitter styling including hashtags and emoticons. This would appeal to any Twitter user.*



Task 2: The Hello World

DEFINE PROCEDURE ''GREETING'' [N]:
BLOCK 0: BEGIN
  PRINT['Hello World! This is written in BlooP.']
BLOCK 0: END.

GREETING[0];


As you can see, this is a prime golfing language.*



Task 3: The Odd Numbers

DEFINE PROCEDURE ''IS-ODD'' [N]:
BLOCK 0: BEGIN
  OUTPUT &lt;= 0;
  CELL(0) &lt;= 2;
  LOOP AT MOST N+1 TIMES:
  BLOCK 1: BEGIN
    IF N+1 = CELL(0), THEN:
    BLOCK 2: BEGIN
      OUTPUT &lt;= 1;
      ABORT LOOP 1;
    BLOCK 2: END;
    CELL(0) &lt;= CELL(0) + 2
  BLOCK 1: END;
BLOCK 0: END.

DEFINE PROCEDURE ''ODDS-IN-RANGE'' [A,B]:
BLOCK 0: BEGIN
  CELL(0) = A;
  LOOP AT MOST B TIMES:
  BLOCK 1: BEGIN
    IF CELL(0) &gt; B, THEN:
    ABORT LOOP 1;
    IF IS-ODD[CELL(0)] = 1, THEN:
    PRINT[CELL(0)];
    CELL(0) &lt;= CELL(0) + 1;
  BLOCK 1: END;
BLOCK 0: END.

ODDS-IN-RANGE[20,25];


The only available operators in BlooP are assignment (&lt;=), addition, multiplication, greater than, less than, and equals. Because of its painfully verbose syntax, it's actually pretty easy to tell what's going on even without a deep understanding of the language.



Task 4: The Interesting

Note: My snippet for this task is subject to change should I come up with something more interesting.

DEFINE PROCEDURE ''MINUS'' [M,N]:
BLOCK 0: BEGIN
  IF M &lt; N, THEN:
  QUIT BLOCK 0;
  LOOP AT MOST M + 1 TIMES:
  BLOCK 1: BEGIN
    IF OUTPUT + N = M, THEN:
    ABORT LOOP 1;
    OUTPUT &lt;= OUTPUT + 1;
  BLOCK 1: END;
BLOCK 0: END.

DEFINE PROCEDURE ''FIB''[N]:
BLOCK 0: BEGIN
  IF N &lt; 1, THEN:
  QUIT BLOCK 0;
  OUTPUT &lt;= 1;
  IF N &lt; 3, THEN:
  QUIT BLOCK 0;
  OUTPUT &lt;= FIB[MINUS[N,1]] + FIB[MINUS[N,2]];
BLOCK 0: END.

FIB[10];


Behold, the Fibonacci numbers.



*May not be true