There are some new hot web server frameworks: Ruby on Rails (Ruby), Yaws+ErlyWeb (Erlang) and HAppS (Haskell.)
These new frameworks are supposed to facilitate fast development. But, how fast - and scalable - are the applications built in and for these frameworks?
The goal of this post is to get a preliminary answer to this question. NOTE: […]
I had this idea a few weeks ago, of merging the syntactical features of algebraic data types with the implementation freedom of abstract data types. Coming to think about it, I had this idea in 1988, when I created an equational "mathematics" system on top of Prolog.
Most people having dealt with declarative languages have encountered [...]
An algebraic data type is a type defined via constructors that can subsequently – often in a functional language setting – be used in pattern matching. The typical example is (using Haskell syntax):
PLAIN TEXT
HASKELL:
data IntStack = Empty | Cons Int IntStack
One can view the type constructors (Cons and Empty above) as regular functions acting on [...]
Parsing code is hard, and strictly limited to The Chosen Few. Right? No, wrong!
I know you are aware of some compiler compilers or parser generators out there – i.e., frameworks that let you specify annotated grammar descriptions, often using a BNF (Backus Naur Form) kind of syntax. The most famous parser generator is Yacc, which [...]