Scalaris - Google Code. Scalaris, a distributed transactional key-value store Scalaris is a scalable, transactional, distributed key-value store. It was the first NoSQL database, that supported the ACID properties for multi-key transactions. It can be used for building scalable Web 2.0 services. Scalaris uses a structured overlay with a non-blocking Paxos commit protocol for transaction processing with strong consistency over replicas. Scalaris is implemented in Erlang. Documentation / Download / Discussion: The Scalaris project was initiated and is mainly developed by Zuse Institute Berlin. Current Stable Release Scalaris 0.6.1 - October 11, 2013 Packaging add ArchLinux ruby API packages Demonstrator "Wiki on Scalaris" (supported by 4CaaSt and Contrail separate list counters from their list partitions for a better data layout fix high memory use of the Scalaris import if the import is slow use tomcat 7.0.42 Business Logic Infrastructure Tests Documentation Tools Bugs.
The blog » Be more functional. Since I’ve dissed patterns and OOP recently (and rightly so) I thought I’d be a little positive and recycle an email I sent a friend a while ago. This someone was curious about functional languages after I had mentioned them over dinner as he had no experience with them. I absolutely think that if all you have ever used is an imperative language (exemplified by C++, Java, C# and other similar crap) I highly recommend spending (at least) several days learning a functional language. You’ll be a better programmer for it. (And why not learn some logic programming too, while you’re at it.) What follows is a somewhat edited version of the 30-minute stream-of-consciousness crash-course email I sent to my friend. Over the years I’ve played around with a lot of different functional languages (including Miranda, Standard ML, Haskell, FP, LISP, and Scheme). To follow along, begin by downloading and installing an SML interpreter. A smattering of SML First, some fundamentals.
To recap, these 4(!) Index - erldocs.com. Mochiweb - Google Code. Whitepaper. Erlang factoery 2009 ted leung. I spent Thursday and Friday of last week at the Erlang Factory in San Francisco (although the event was actually in Palo Alto). I’ve written about Erlang in this space before. Erlang is having a major influence on other languages, such as Scala on the JVM side and Axum on the CLR side. In addition every language seems to have several implementation of Erlang style “actors” (despite the fact that this is historically incorrect).
Erlang has been around for a long time, and has seen industrial usage in demanding telecom applications. As a dynamically typed functional language with good support for concurrency and distribution, it is (if nothing else) a source of interesting ideas. Earlier this year, my boss asked me to start doing some thinking about cloud computing in addition to the stuff that I was already doing around dynamic languages — another good match for Erlang. The program at the Erlang Factory was very strong. The Erlang community (like all communities) has it’s old guard. Erlang. Scala vs erlang comparison. Keeping Erlang in mind, I've coded two months in Scala, I'm thinking something called "Scala vs Erlang", I wrote some benchmark code to prove me (the code and result may be available someday), and I'd like to do some gradually summary on it in practical aspect.
These opinions may be or not be correct currently due to lacking of deep experience and understanding, but, anyway, I need to record them now and correct myself with more experiences and understanding got on both Scala and Erlang. Part I. Syntax ¶ List comprehension ¶ Erlang: Lst = [1,2,3,4],[X + 1 || X <- Lst],lists:map(fun(X) -> X + 1 end, Lst) Erlang Scala: val lst = List(1,2,3,4) for (x <- lst) yield x + 1 lst.map{x => x + 1} lst.map{_ + 1} // or place holder Scala Pattern match ¶ case X of {A, B} when is_integer(A), A > 1 -> ok; _ -> error end, {ok, [{A, B} = H|T]} = my_function(X) List, Tuple, Array, Map, Binary, Bit ¶ Lst = [1, 2, 3] %% List [0 | Lst] %% List concat {1, 2, 3} %% Tuple <<1, 2, “abc”>> %% Binary %% no Array, Map syntax.
What Sucks About Erlang. What Sucks About Erlang There are the languages everyone complains about, and there are the languages no one uses. Having said that, it's time to whine about my favorite language I use quite extensively. Erlang, I love ya, but we need to have a word. Basic Syntax Erlang is based originally on Prolog, a logic programming language that was briefly hot in the 80's. Surely you've seen other languages based on Prolog, right? No? The problem is, unlike the C and Algol based languages, Erlang's syntax does away with nested statement terminators and instead uses expression separators everywhere. Because Erlang's expression terminators vary by context, editing code is much harder than conventional languages.
Consider this code: blah(true) -> foo(), bar(); blah(false) -> baz(). Lets say I want to reorder the branches: blah(false) -> baz(); blah(true) -> foo(), bar(). Or change the order which foo() and bar() are called. blah(true) -> bar(), foo(); blah(false) -> baz(). What's the problem? If Expressions.