Personal tools

Blog articles/Comparisons

From HaskellWiki

< Blog articles(Difference between revisions)
Jump to: navigation, search
m
(Oz: No more Oz...)
(11 intermediate revisions by 6 users not shown)
Line 17: Line 17:
 
* [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 35: Line 34:
 
* [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 46: Line 44:
 
== 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 52: Line 50:
 
* [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
+
* [http://blog.plt-scheme.org/2007/11/getting-rid-of-set-car-and-set-cdr.html Immutable lists for PLT Scheme]
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 154: Line 154:
 
* [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 ==

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

1 Functional programming

1.1 CAL

1.2 F#

1.3 OCaml

1.4 Erlang

1.5 Lisp


1.6 Qi

1.7 Prolog

A Wake Up Call for the Logic Programming Community

1.8 Scheme

1.9 XSLT

1.10 CAS Mathematica

2 Theorem provers

2.1 Epigram

2.2 Agda

2.3 Coq


2.4 Isabelle

3 Stack programming

3.1 Forth

3.2 Factor

3.3 Cat

4 Imperative, statically typed

4.1 Ada

4.2 C

4.3 C#

4.4 C++

4.5 Eiffel

4.6 Java

4.7 Scala

5 Imperative, dynamically typed

5.1 Javascript

5.2 ActionScript

5.3 Lua

5.4 Perl

5.5 Python

5.6 Ruby