Personal tools

Blog articles/Comparisons

From HaskellWiki

< Blog articles(Difference between revisions)
Jump to: navigation, search
(Oz: No more Oz...)
 
(13 intermediate revisions by 7 users not shown)
Line 1: Line 1:
 
[[Category:Tutorials]]
 
[[Category:Tutorials]]
   
Articles comparing Haskell to other languages.
+
Articles comparing Haskell to other languages, or describing the use of
  +
Haskell techniques in other languages.
   
 
= Functional programming =
 
= Functional programming =
Line 16: Line 16:
 
* [http://www.brandonwerner.com/2008/01/13/the-rise-of-functional-programming-fscalahaskell-and-the-failing-of-lisp/ The Rise Of Functional Programming: F#/Scala/Haskell and the failing of Lisp]
 
* [http://www.brandonwerner.com/2008/01/13/the-rise-of-functional-programming-fscalahaskell-and-the-failing-of-lisp/ The Rise Of Functional Programming: F#/Scala/Haskell and the failing of Lisp]
 
* [http://cs.hubfs.net/blogs/hell_is_other_languages/archive/2008/01/16/4565.aspx Software Transactional Memory for F#]
 
* [http://cs.hubfs.net/blogs/hell_is_other_languages/archive/2008/01/16/4565.aspx Software Transactional Memory for F#]
  +
* [http://fortysix-and-two.blogspot.com/2008/05/fscheck-random-testing-for-f.html QuickCheck for F#]
  +
* [http://lorgonblog.spaces.live.com/Blog/cns!701679AD17B6D310!256.entry Catamorphisms in F#]
   
 
== OCaml ==
 
== OCaml ==
   
* [http://enfranchisedmind.com/blog/archive/2007/08/06/307 A Monad Tutorial for Ocaml]
+
* [http://enfranchisedmind.com/blog/posts/a-monad-tutorial-for-ocaml/ A Monad Tutorial for Ocaml]
* [http://wagerlabs.com/archives/92.html Who let the dogs out]
+
* [http://alaska-kamtchatka.blogspot.com/2008/01/pointless-polymorphism.html Pointfree programming in OCaml]
* [http://alaska-kamtchatka.blogspot.com/2008/01/pointless-polymorphism.html Pointfree programming in OCaml]]
 
* [http://fhtr.blogspot.com/2008/02/simple-unix-tools-in-ocaml.html Simple UNIX tools in OCaml]
 
   
 
== Erlang ==
 
== Erlang ==
 
* [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://chlorophil.blogspot.com/2007/11/pare-parallel-execution-in-erlang.html PARE - PARallel Execution in Erlang - a response to Haskell]
 
* [http://chlorophil.blogspot.com/2007/11/pare-parallel-execution-in-erlang.html PARE - PARallel Execution in Erlang - a response to Haskell]
   
Line 32: Line 33:
 
* [http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/ List comprehensions in Common Lisp]
 
* [http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/ List comprehensions in Common Lisp]
   
== Oz ==
+
* [http://boriken.frayser.org/wordpress/2007/07/04/appreciating-chr-constraint-handling-rules-systems/ Appreciating Constraint Programming]
 
   
 
== Qi ==
 
== Qi ==
Line 42: Line 43:
 
== Prolog ==
 
== 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]
+
[http://www.cs.kuleuven.ac.be/~dtai/projects/ALP/newsletter/dec07/content/Articles/tom/content.html A Wake Up Call for the Logic Programming Community]
   
 
== Scheme ==
 
== Scheme ==
Line 48: Line 49:
 
* [http://programming.reddit.com/goto?id=nq1k Haskell versus Scheme]
 
* [http://programming.reddit.com/goto?id=nq1k Haskell versus Scheme]
 
* [http://shaurz.wordpress.com/2008/03/11/haskell-style-parser-combinators-in-scheme/ Haskell-style parser combinators in Scheme]
 
* [http://shaurz.wordpress.com/2008/03/11/haskell-style-parser-combinators-in-scheme/ Haskell-style parser combinators in Scheme]
  +
* [http://blog.plt-scheme.org/2007/11/getting-rid-of-set-car-and-set-cdr.html Immutable lists for PLT Scheme]
   
 
== XSLT ==
 
== XSLT ==
 
* [http://porg.es/blog/computing-with-xslt Computing with XSLT]
 
* [http://porg.es/blog/computing-with-xslt Computing with XSLT]
  +
  +
== CAS Mathematica ==
  +
* [http://zufaellige-reflektion.blogspot.com/2011/01/haskell-eiger-for-mathematica.html Functional programming examples]
   
 
= Theorem provers =
 
= Theorem provers =
Line 101: Line 106:
 
* [http://www.developer.com/net/csharp/article.php/3598381 The New Lambda Expressions Feature in C# 3.0]
 
* [http://www.developer.com/net/csharp/article.php/3598381 The New Lambda Expressions Feature in C# 3.0]
 
* [http://blogs.msdn.com/wesdyer/archive/2007/03/01/immutability-purity-and-referential-transparency.aspx Immutability, Purity, and Referential Transparency in C#]
 
* [http://blogs.msdn.com/wesdyer/archive/2007/03/01/immutability-purity-and-referential-transparency.aspx Immutability, Purity, and Referential Transparency in C#]
  +
* [http://blogs.msdn.com/ericlippert/archive/2007/10/04/path-finding-using-a-in-c-3-0-part-two.aspx "Immutable data structures are the way of the future in C#"]
 
* [http://lukeplant.me.uk/blog.php?id=1107301659 Null pointers vs None vs Maybe]
 
* [http://lukeplant.me.uk/blog.php?id=1107301659 Null pointers vs None vs Maybe]
 
* [http://enfranchisedmind.com/blog/archive/2007/07/10/279 The "ole in the middle "pattern]
 
* [http://enfranchisedmind.com/blog/archive/2007/07/10/279 The "ole in the middle "pattern]
Line 110: Line 116:
 
* [http://diditwith.net/2007/11/14/ImproveYourCBorrowFromF.aspx Improve Your C#! Borrow from F#...]
 
* [http://diditwith.net/2007/11/14/ImproveYourCBorrowFromF.aspx Improve Your C#! Borrow from F#...]
 
* [http://blogs.msdn.com/wesdyer/archive/2008/01/11/the-marvels-of-monads.aspx? The Marvels of Monads (in C#)]
 
* [http://blogs.msdn.com/wesdyer/archive/2008/01/11/the-marvels-of-monads.aspx? The Marvels of Monads (in C#)]
  +
* [http://www.bluebytesoftware.com/blog/CommentView,guid,bae6ac13-2a95-4887-9ee3-3e64867c5650.aspx Immutable types can copy the world& safely!]
  +
* [http://blogs.msdn.com/ericlippert/archive/2007/12/19/immutability-in-c-part-seven-more-on-binary-trees.aspx Immutability in C# Part Seven: More on Binary Trees]
  +
* [http://blogs.msdn.com/lucabol/archive/2008/01/11/creating-an-immutable-value-object-in-c-part-v-using-a-library.aspx Creating an immutable value object in C# - Part V - Using a library]
   
 
== C++ ==
 
== C++ ==
Line 134: Line 143:
 
* [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?]
+
* [http://www.drmaciver.com/2008/01/why-not-scala/ Why not Scala?]
 
* [http://debasishg.blogspot.com/2008/03/monads-another-way-to-abstract.html Monads in Scala]
 
* [http://debasishg.blogspot.com/2008/03/monads-another-way-to-abstract.html Monads in Scala]
 
* [http://patricklogan.blogspot.com/2008/01/scala-buzzzzings.html Scala Buzzzzings]
 
* [http://patricklogan.blogspot.com/2008/01/scala-buzzzzings.html Scala Buzzzzings]
Line 144: Line 153:
 
* [http://satta.org/2007/01/08/foldr-and-foldl-in-javascript/ foldr and foldl in JavaScript]
 
* [http://satta.org/2007/01/08/foldr-and-foldl-in-javascript/ foldr and foldl in JavaScript]
 
* [http://osteele.com/sources/javascript/functional/ Functional Javascript]
 
* [http://osteele.com/sources/javascript/functional/ Functional Javascript]
  +
* [http://w3future.com/weblog/stories/2008/06/16/adtinjs.xml Algebraic data types in JS]
  +
* [http://infrared-clearance.blogspot.com/2008/07/top-down-operator-precedence-in-haskell.html JavaScript translated and compared to Haskell]
   
 
== ActionScript ==
 
== ActionScript ==
Line 169: Line 180:
 
* [http://sigfpe.blogspot.com/2008/02/purely-functional-recursive-types-in.html Purely functional recursive types in Haskell and Python]
 
* [http://sigfpe.blogspot.com/2008/02/purely-functional-recursive-types-in.html Purely functional recursive types in Haskell and Python]
 
* [http://www.valuedlessons.com/2008/02/pysec-monadic-combinatoric-parsing-in.html Pysec: Monadic Combinatoric Parsing in Python (aka Parsec in Python)]
 
* [http://www.valuedlessons.com/2008/02/pysec-monadic-combinatoric-parsing-in.html Pysec: Monadic Combinatoric Parsing in Python (aka Parsec in Python)]
  +
* [http://www.valuedlessons.com/2007/12/immutable-data-in-python-record-or.html Immutable Data in Python (Record or Named Tuple)]
   
 
== Ruby ==
 
== Ruby ==

Latest revision as of 15:45, 26 January 2012


Articles comparing Haskell to other languages, or describing the use of Haskell techniques in other languages.

Contents

[edit] 1 Functional programming

[edit] 1.1 CAL

[edit] 1.2 F#

[edit] 1.3 OCaml

[edit] 1.4 Erlang

[edit] 1.5 Lisp


[edit] 1.6 Qi

[edit] 1.7 Prolog

A Wake Up Call for the Logic Programming Community

[edit] 1.8 Scheme

[edit] 1.9 XSLT

[edit] 1.10 CAS Mathematica

[edit] 2 Theorem provers

[edit] 2.1 Epigram

[edit] 2.2 Agda

[edit] 2.3 Coq


[edit] 2.4 Isabelle

[edit] 3 Stack programming

[edit] 3.1 Forth

[edit] 3.2 Factor

[edit] 3.3 Cat

[edit] 4 Imperative, statically typed

[edit] 4.1 Ada

[edit] 4.2 C

[edit] 4.3 C#

[edit] 4.4 C++

[edit] 4.5 Eiffel

[edit] 4.6 Java

[edit] 4.7 Scala

[edit] 5 Imperative, dynamically typed

[edit] 5.1 Javascript

[edit] 5.2 ActionScript

[edit] 5.3 Lua

[edit] 5.4 Perl

[edit] 5.5 Python

[edit] 5.6 Ruby