A Taste of the Star Programming Language
A while ago, I was exploring creating a programming language with Instaparse. I ended up exploring some concepts of Speech Acts proposed by John McCarthy by creating my first toy language called Babar. Shortly after posting a blog about it, I got an email from someone saying that I might be interested in a full blown, real programming language that also incorporated Speech Acts. I happily started composing an reply to the email that started off with
That is so cool! ...
Then I realized that the author of the email and language was none other than Frank McCabe, one of the designers of the Go! programming language (not to be confused with Google Go). My brain froze while it was thinking
"OMG!!!! Frank McCabe, a real language designer, just emailed me!".
This unfortunately, made the rest of my email reply sound something like this
Frank,
That is so cool! herp derp derp Speech Acts herp derp John
McCarthy derp...
His programming language is the Star Programming Language. It was originally developed for use at a company that he worked at called Starview. It has since been open sourced and moved to git. I finally had a bit a spare time and I had been itching to give Star a look. To my pleasant surprise, despite my initial fumbling email impression, Frank was open a friendly to get me started in it. I have only scratched the surface in exploring the language, but I wanted to share my initial impressions, as well as point you to some beginner katas that I put together, so that you could join in the fun.
Crash Overview
Star is a strongly typed, functional language. It is not a pure functional language because is allows assignment and stateful objects, but the language is designed in a way that immutable functional programming is encouraged. The feel of the language is concise but human readable.
Star is a coherent, general-purpose programming language that
combines elements from a wide variety of existing languages as
well as adding innovative elements of its own. Star inherits func-
tional programming in general, a Haskell-style type system, an F#-
style monad for parallel computations, and Concurrent ML for or-
chestrating concurrent and parallel applications.
Hello World
The best way to get a feel for it is to look at a few examples. Of course, let’s start off with Hello World.
1 2 3 |
|
Another way of doing our Hello World is in a worksheet. This feature is still in the works, but it will likely turn into a replacement for a REPL, being integrated into the editor. The import statement will also soon not be required. But a nice feature of using the worksheeet is that is a combined module and transcript of the session.
1 2 3 4 5 |
|
Here is what the output looks like:
Jun 11, 2014 11:21:09 AM
INFO: "hello world" -> "hello world" at 4
info: execution took 0.053684428
Pattern Matching
Let’s take a look at another example. This time a naive fib function with pattern matching.
1 2 3 4 5 6 7 8 9 10 11 12 |
|
Notice how the fib function is defined with pattern matching. Also how the keyword “is” is used instead of an “=” to make the code flow more readable (IMO).
The output of running the program is:
Jun 11, 2014 3:32:38 PM
INFO: fib(0) = 0 ok at 9
Jun 11, 2014 3:32:38 PM
INFO: fib(1) = 1 ok at 10
Jun 11, 2014 3:32:38 PM
INFO: fib(3) = 2 ok at 11
Jun 11, 2014 3:32:38 PM
INFO: fib(10) = 55 ok at 12
info: execution took 0.039725132
Pattern Matching with Guards
The declaration of pattern matching for functions can also include guards like in this fizzbuzz example
1 2 3 4 5 |
|
Also note the type declaration. The type declaration is optional. The complier is smart enough to figure it out. Sometimes it is more readable to include the type declaration. But, it can be left out for more concise code.
Cons Lists
One of the important collection types are cons lists. These are lists that you add to the front of and are destructed as the first element and then the rest of the list. To construct a cons list:
1
|
|
To use a cons list in a function with pattern matching:
1 2 3 |
|
The function listFizzBuzz takes in a list of integers and turns it into a list of strings using the fizzbuzz function. If we evaluate:
1 2 |
|
The result will look like
1
|
|
There are other collection types such as arrays and relations, (which are really cool - you can do queries on them like a database), but I haven’t explored them well enough to really talk about yet.
Actors and Speech Acts
Star has actors that use three Speech Acts: Notify, Request, and Query. The actors themselves can also be concurrent. I explored the Speech Act/ Actor model with an example from John McCarthy’s Elephant 2000 paper, which is a Airline Reservation system.
To use the notify speech act, you need to define what type the notifications are on the actors channel. In my case, the notifications are either going to be a book(string) method, or a cancel(string) method. To book a reservation for a person or cancel it.
1
|
|
The actor is defined using:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
|
There is some extra things in the code, but for right now, look at the book and cancel methods. These are the functions that will be called when the actor is notified like this:
1 2 3 |
|
To query the actor we use :
1
|
|
To use a request with the actor we use
1
|
|
Go Explore
I have only scratched the surface of the language, but I have had a great time. I invite you to come take a look.
Warning. Only the brave need apply. There is no StackOverflow. There is no user group or IRC channel yet. These are green fields to be discovered in the Open Source world. If it appeals to you as much as me, jump on in. Here are a few resources to get you going:
Star-Lang Katas: Clone the repo or fork the repos. It has a shell script to compile and run the star programs. It also has a emacs mode plugin and a reference pdf. The most important part is that it has a template of katas ready for your to solve. Your challenge: uncomment the assertion and make the code pass. My solutions are in the solutions branch when you are done. If you finish all of them and want more, consider creating some and submitting a pull request :)
I mentioned it earlier, but there is a great overview paper on the language itself here.
Finally, here is the repo of the Star Language itself https://github.com/fmccabe/star. Checkout out the tests. There are tons of sample star programs that cover the language’s features.