Difference between revisions of "Blog articles/Comparisons"
Jump to navigation
Jump to search
DonStewart (talk | contribs) (→C#) |
DonStewart (talk | contribs) (→Agda) |
||
Line 51: | Line 51: | ||
* [http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=71 Simple proof of stack correctness for a tiny language (in Agda)] |
* [http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=71 Simple proof of stack correctness for a tiny language (in Agda)] |
||
+ | * [http://www.iis.sinica.edu.tw/~scm/?p=35 My First Agda Program: Append, Reverse, and Merge] |
||
+ | * [http://www.iis.sinica.edu.tw/~scm/?p=36 Agda Exercise: Sized Mergesort] |
||
== Coq == |
== Coq == |
Revision as of 16:22, 27 September 2007
Articles comparing Haskell to other languages.
Functional programming
CAL
F#
OCaml
Erlang
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
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#
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
Scala
Imperative, dynamically typed
Javascript
Lua
Perl 6
Python
- Haskell versus Python
- Using Haskell in Python: haskellembed
- Understanding Monads Via Python List Comprehensions