Difference between revisions of "Blog articles/Comparisons"
Jump to navigation
Jump to search
(→Oz: No more Oz...) |
|||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 22: | Line 22: | ||
== OCaml == |
== OCaml == |
||
| − | * [http://enfranchisedmind.com/blog/ |
+ | * [http://enfranchisedmind.com/blog/posts/a-monad-tutorial-for-ocaml/ A Monad Tutorial for Ocaml] |
| − | * [http:// |
+ | * [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 37: | 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 == |
||
Revision as of 15:45, 26 January 2012
Articles comparing Haskell to other languages, or describing the use of
Haskell techniques in 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
- The Rise Of Functional Programming: F#/Scala/Haskell and the failing of Lisp
- Software Transactional Memory for F#
- QuickCheck for F#
- Catamorphisms in F#
OCaml
Erlang
- Small comparison of Erlang's syntactic difficulties
- 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
Qi
- Foldl and Foldr
- SKI in Qi's type system
- Haskell-like Type Classes in Qi
- Existential Data Constructors in Haskell and Qi
Prolog
A Wake Up Call for the Logic Programming Community
Scheme
- Floating point in ElSchemo (a scheme written in Haskell)
- Haskell versus Scheme
- Haskell-style parser combinators in Scheme
- Immutable lists for PLT Scheme
XSLT
CAS Mathematica
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#
- "Immutable data structures are the way of the future 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#...
- The Marvels of Monads (in C#)
- Immutable types can copy the world& safely!
- Immutability in C# Part Seven: More on Binary Trees
- Creating an immutable value object in C# - Part V - Using a library
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
- Haskell, CAL and Scala
- Type classes
- Generics for type-safe persistence
- Why not Scala?
- Monads in Scala
- Scala Buzzzzings
- unfolds in scala
Imperative, dynamically typed
Javascript
- foldr and foldl in JavaScript
- Functional Javascript
- Algebraic data types in JS
- JavaScript translated and compared to Haskell
ActionScript
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
- Property checking with Python's nose testing framework
- Why are my monads (in Python) so slow?
- Monads in Python (with nice syntax!)
- Haskell's do syntax for python and ruby
- Error handling in Python: monads are too much for me
- Purely functional recursive types in Haskell and Python
- Pysec: Monadic Combinatoric Parsing in Python (aka Parsec in Python)
- Immutable Data in Python (Record or Named Tuple)
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
- Prospering with ruby vs. haskell
- Monads in Ruby (with nice syntax!)