The Problem with "dup" and "swap" in Stack-Based Languages | Lambda the Ultimate
Operations like "dup" and "swap" in stack-based languages are special in that they return multiple results (unlike most other languages which simulate multiple results by returning tuples). I find expressing the concept in a type system challenging (if anyone else has done it successfully I would definitely like to hear about it). One of the core problems is that the type of a function like eval,
The Essence of Concatenative Languages
Andreas Rossberg defined a concise and elegant type system for the concatenative language Cat created by Christopher Diggins that makes clear, once and for all, that the nature of the paradigm is solidly functional, point-free and higher order in a way that, as John Nowak remarks, goes beyond the original conception of Backus' FP. Here I wish to contribute to fixing these important ideas by presen
A Cross-language Comparison of Monads in Haskell, O’Caml, and Qi
Benjamin's Adventures in Programming Language Theory Wonderland A few days ago, there was an interesting post by Rafael Gustavo da Cunha Pereira Pinto, dated “Mon, 5 Jan 2009 09:08:37 -0200,” on the Haskell-beginners mailing list on the Haskell programming language, referencing a monad tutorial for the O’Caml programming language that provided an alternative perspective in helping to illustrate mo
Y Combinator - LoveRubyNet
$Id: ycombinator.html,v 1.6 2002/06/27 23:37:39 aamine Exp $ [ruby-list:35058] に刺激を受けて Y combinator を解読してみた。 こんなもん読むくらいなら以下の参考ページを読んだほうがいい。 参考にした (というかほとんどそのままな) ページ (英語) http://www.ececs.uc.edu/~franco/C511/html/Scheme/ycomb.html 動機 再帰関数は再帰するときに自分自身を名前で呼ぶのが普通である。 これをなんとかして名前を使わず、関数そのものを呼ぶように させたい。 求めかた まず単純な fact (階乗) を以下に示す。言語は Scheme である。 (define fact (lambda (n) (if (zero? n) 1 (* n (fact (- n
What is Hindley-Milner? (and why is it cool?) - Code Commit
Daniel Spiewak is a software engineer based out of Chicago, IL. Over the years, he has worked with Scala, Java, Ruby, Go, Haskell, C/C++, SML, Clojure, and countless other languages, covering topics ranging from type theory, compiler and language design, globally distributed systems, JVM optimization, large-scale AI data infrastructure, data structures, OLAP and OLTP databases, mechanical sympathy
λ Tony’s blog λ » Blog Archive » Haskell exercises for beginners
The exercises below are similar to my previous ‘Scala exercises for beginners’, except the rules a little clearer. For those of who have emailed me or submitted responses here on the blog, I will get around to providing you feedback, however, I’d prefer to do so on the revised version of the Exercises since then I can maintain a bit of clarity in explaining the solutions; specifically, why one may
John Resig - JavaScript iPhone Apps
I’ve been watching, with interest, developers create new applications for the iPhone. Owning one myself – and being knowledgeable in JavaScript – I’ve been wondering what options there were for creating downloadable JavaScript applications or the iPhone. In doing some research I found a number of solutions, some simpler than others, some requiring more knowledge of Objective-C than others. Before
cabalコマンドの使い方 - あどけない話
Cabal は Haskell のパッケージ管理システムです。枠組みとしての Cabal と、コマンドの cabal があり、間違いやすいです。 Cabal は、パッケージをコンパイルし、インストールする枠組みです configure, make, make install に相当 cabal は、パッケージの依存関係を調べ、必要なパッケージをダウンロードして、インストールするためのコマンドです cabal-install と呼ばれることもあります ここでは、コマンド cabal の使い方を説明します。 インストール 各 OS のパッケージ管理システムを使って cabal をインストールしましょう。GHC を扱っているパッケージ管理システムであれば、cabal にも対応しているはずです。 MacPorts では、以下のようにします。 % sudo port install hs-cabal
Notes on Introduction To Algorithms | Lambda the Ultimate
Peteris Krumins has been posting his notes on MIT’s Introduction to Algorithms. The notes are valuable for anyone interested in working their way through the CLRS text and MIT Open Courseware videos. I just finished watching the last lecture of MIT’s "Introduction to Algorithms" course. Having a great passion for all aspects of computing, I decided to share everything I learned... Although not
Parked at Loopia
This domain has been purchased and parked by a customer of Loopia. Use LoopiaWHOIS to view the domain holder's public information. Are you the owner of the domain and want to get started? Login to Loopia Customer zone and actualize your plan. Register domains at Loopia Protect your company name, brands and ideas as domains at one of the largest domain providers in Scandinavia. Search available dom
The adventures of a Pythonista in Schemeland/3
The Explorer The adventures of a Pythonista in Schemeland/3 by Michele Simionato September 29, 2008 Summary In this episode I will talk about Scheme syntax, i.e. about the prefix notation and the infamous parentheses(!) Of parentheses and indentation In the previous two episodes I have discussed a few important subjects such as availability of libraries, reliability of implementations, support in
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Hacking with Caffeine : The Art of SquirrelFish's Bytecode Generation
Parsing Expression Grammars
What is special about combinators in Joy
http://www.codecommit.com/blog/cat/the-joy-of-concatenative-languages-part-3
Monoids? In my programming language?
homoiconic/2008-11-07/from_birds_that_compose_to_method_advice.markdown at master · raganwald-deprecated/homoiconic
lucidmac.com
SanderSn.com is for sale | HugeDomains
NewSpeak at JavaZone | Ola Bini: Programming Language Synchronicity