Difference between revisions of "Blog articles/Comparisons"
Jump to navigation
Jump to search
DonStewart (talk | contribs) (→Perl 6) |
DonStewart (talk | contribs) (more comparisons) |
||
| Line 11: | Line 11: | ||
* [http://blogs.msdn.com/dsyme/archive/2007/09/22/some-details-on-f-computation-expressions-aka-monadic-or-workflow-syntax.aspxF#'s monadic syntax] |
* [http://blogs.msdn.com/dsyme/archive/2007/09/22/some-details-on-f-computation-expressions-aka-monadic-or-workflow-syntax.aspxF#'s monadic syntax] |
||
| + | * [http://corsis.blogspot.com/2008/01/haskell-and-f-language-design.html Haskell and F#: Language Design] |
||
| + | * [http://www.quanttec.com/fparsec/ FParsec - A Parser Combinator Library for F#] |
||
| + | * [http://jyliao.blogspot.com/2007/11/learning-wpf-with-f-dock-and-grid.html zip in F# and Haskell] |
||
== OCaml == |
== OCaml == |
||
| Line 20: | Line 23: | ||
* [http://www.acooke.org/cute/ErlangsSyn0.html Small comparison of Erlang's syntactic difficulties] |
* [http://www.acooke.org/cute/ErlangsSyn0.html Small comparison of Erlang's syntactic difficulties] |
||
* [http://blog.tornkvist.org/?id=1185571582964040 Compiling Haskell to Erlang] |
* [http://blog.tornkvist.org/?id=1185571582964040 Compiling Haskell to Erlang] |
||
| + | * [http://chlorophil.blogspot.com/2007/11/pare-parallel-execution-in-erlang.html PARE - PARallel Execution in Erlang - a response to Haskell] |
||
== Lisp == |
== Lisp == |
||
| Line 34: | Line 38: | ||
* [http://programmingkungfuqi.blogspot.com/2007/08/haskell-like-type-classes-in-qi.html Haskell-like Type Classes in Qi] |
* [http://programmingkungfuqi.blogspot.com/2007/08/haskell-like-type-classes-in-qi.html Haskell-like Type Classes in Qi] |
||
* [http://programmingkungfuqi.blogspot.com/2007/08/existential-data-constructors-in.html Existential Data Constructors in Haskell and Qi] |
* [http://programmingkungfuqi.blogspot.com/2007/08/existential-data-constructors-in.html Existential Data Constructors in Haskell and Qi] |
||
| + | |||
| + | == Prolog == |
||
| + | |||
| + | * [http://www.cs.kuleuven.ac.be/~dtai/projects/ALP/newsletter/dec07/content/Articles/tom/content.htmlA Wake Up Call for the Logic Programming Community] |
||
== Scheme == |
== Scheme == |
||
| Line 96: | Line 104: | ||
* [http://blogs.msdn.com/lukeh/archive/2007/08/19/monadic-parser-combinators-using-c-3-0.aspx Monadic Parser Combinators using C# 3.0] |
* [http://blogs.msdn.com/lukeh/archive/2007/08/19/monadic-parser-combinators-using-c-3-0.aspx Monadic Parser Combinators using C# 3.0] |
||
* [http://www.aboutcode.net/2007/09/27/Lazy+Functions+In+LINQ.aspx Lazy functions in C#] |
* [http://www.aboutcode.net/2007/09/27/Lazy+Functions+In+LINQ.aspx Lazy functions in C#] |
||
| + | * [http://zerogradient.wordpress.com/2007/12/05/functional-programming-on-net-part-1/ Functional Programming on .NET - Part 1] |
||
| + | * [http://gavinbierman.blogspot.com/2007/11/laziness-in-clinq.html Laziness in C#/LINQ] |
||
| + | * [http://diditwith.net/2007/11/14/ImproveYourCBorrowFromF.aspx Improve Your C#! Borrow from F#...] |
||
== C++ == |
== C++ == |
||
| Line 114: | Line 125: | ||
* [http://blog.tmorris.net/maybe-monad-in-java/ Maybe monad in Java] |
* [http://blog.tmorris.net/maybe-monad-in-java/ Maybe monad in Java] |
||
* [http://rickyclarkson.blogspot.com/2007/09/point-free-programming-in-java-7-beyond.html Point-free Programming in Java 7 - Beyond Closures] |
* [http://rickyclarkson.blogspot.com/2007/09/point-free-programming-in-java-7-beyond.html Point-free Programming in Java 7 - Beyond Closures] |
||
| + | * [http://jpmoresmau.blogspot.com/2007/11/structure-of-functional-java-er-method.html Structure of a functional Java, er, method] |
||
== Scala == |
== Scala == |
||
| Line 119: | Line 131: | ||
* [http://blog.tmorris.net/the-power-of-type-classes-with-scala-implicit-defs Type classes] |
* [http://blog.tmorris.net/the-power-of-type-classes-with-scala-implicit-defs Type classes] |
||
* [http://www.cs.kuleuven.be/~adriaan/?q=cft_intro Generics for type-safe persistence] |
* [http://www.cs.kuleuven.be/~adriaan/?q=cft_intro Generics for type-safe persistence] |
||
| + | * [http://unenterprise.blogspot.com/2008/01/why-not-scala.html Why not Scala?] |
||
= Imperative, dynamically typed = |
= Imperative, dynamically typed = |
||
| Line 132: | Line 145: | ||
* [http://blog.plover.com/2007/11/30/#pow-sqrt Comparative terseness of Perl and Haskell] |
* [http://blog.plover.com/2007/11/30/#pow-sqrt Comparative terseness of Perl and Haskell] |
||
* [http://diveintoperl6.blogspot.com/2007/05/perl-6-round-1_22.html Perl 6] |
* [http://diveintoperl6.blogspot.com/2007/05/perl-6-round-1_22.html Perl 6] |
||
| + | * [http://osfameron.vox.com/library/post/haskell-words-and-perl-split.html Haskell 'words' and Perl 'split'] |
||
== Python == |
== Python == |
||
| Line 153: | Line 167: | ||
* [http://blog.pretheory.com/arch/2007/11/pattern_matching_in_ruby_1.php Pattern matching in Ruby] |
* [http://blog.pretheory.com/arch/2007/11/pattern_matching_in_ruby_1.php Pattern matching in Ruby] |
||
* [http://weblog.raganwald.com/2007/11/really-useful-anamorphisms-in-ruby.html Anamorphisms in Ruby] |
* [http://weblog.raganwald.com/2007/11/really-useful-anamorphisms-in-ruby.html Anamorphisms in Ruby] |
||
| + | * [http://feedingthesnake.wordpress.com/2007/11/30/python-haskell-ruby-smackdown/ Python, Haskell, Ruby Smackdown] |
||
Revision as of 00:24, 6 January 2008
Articles comparing Haskell to other languages.
Functional programming
CAL
F#
- monadic syntax
- Haskell and F#: Language Design
- FParsec - A Parser Combinator Library for F#
- zip in F# and Haskell
OCaml
Erlang
- Small comparison of Erlang's syntactic difficulties
- Compiling Haskell to Erlang
- PARE - PARallel Execution in Erlang - a response to Haskell
Lisp
- Writing lisp in Haskell
- Haskell like data structures in Common Lisp
- List comprehensions in Common Lisp
Oz
Qi
- Foldl and Foldr
- SKI in Qi's type system
- Haskell-like Type Classes in Qi
- Existential Data Constructors in Haskell and Qi
Prolog
Scheme
XSLT
Theorem provers
Epigram
Agda
- Simple proof of stack correctness for a tiny language (in Agda)
- My First Agda Program: Append, Reverse, and Merge
- Agda Exercise: Sized Mergesort
Coq
Isabelle
Stack programming
Forth
Factor
Cat
Imperative, statically typed
Ada
C
C#
- Haskell for C# 3 Programmers
- The New Lambda Expressions Feature in C# 3.0
- Immutability, Purity, and Referential Transparency in C#
- Null pointers vs None vs Maybe
- The "ole in the middle "pattern
- How much Haskell can I squeeze out of C#?
- Monadic Parser Combinators using C# 3.0
- Lazy functions in C#
- Functional Programming on .NET - Part 1
- Laziness in C#/LINQ
- Improve Your C#! Borrow from F#...
C++
Eiffel
Java
- More Haskell in Java 7 or 8?
- Type classes in Java
- Closures and bottom for Java
- An infinite list in Java
- Parser combinators in Java
- Maybe monad in Java
- Point-free Programming in Java 7 - Beyond Closures
- Structure of a functional Java, er, method
Scala
Imperative, dynamically typed
Javascript
Lua
Perl
Python
- Haskell versus Python
- Using Haskell in Python: haskellembed
- Understanding Monads Via Python List Comprehensions
- Solve Ball Clock Puzzle in Python and Haskell
Ruby
- Ruby vs Haskell: choose what works
- Haskell: open secret in Ruby land
- Haskell Eye for the Ruby Guy
- Monads in Ruby
- RushCheck, a lightweight random testing tool for Ruby similar to QuickCheck
- part 1
- zip and transpose
- 37 Reasons to Love Haskell
- Pattern matching in Ruby
- Pattern matching in Ruby
- Anamorphisms in Ruby
- Python, Haskell, Ruby Smackdown