Blog articles/Comparisons
From HaskellWiki
(Difference between revisions)
(→Functional programming) |
|||
| Line 39: | Line 39: | ||
== XSLT == | == XSLT == | ||
* [http://porg.es/blog/computing-with-xslt Computing with XSLT] | * [http://porg.es/blog/computing-with-xslt Computing with XSLT] | ||
| + | |||
| + | = Theorem provers = | ||
| + | |||
| + | == Agda === | ||
| + | |||
| + | * [http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=71] | ||
| + | |||
| + | == Coq == | ||
| + | |||
| + | * [http://blog.mikael.johanssons.org/archive/2007/08/coq-and-simple-group-theory/ Coq and simple group theory] | ||
| + | * [http://sequence.complete.org/node/358 Coq and The Monad Laws: Introduction] | ||
| + | |||
| + | |||
| + | == Isabelle == | ||
= Stack programming = | = Stack programming = | ||
Revision as of 16:43, 23 September 2007
Articles comparing Haskell to other languages.
Contents |
1 Functional programming
1.1 CAL
1.2 F#
1.3 OCaml
1.4 Erlang
1.5 Lisp
1.6 Oz
1.7 Qi
- Foldl and Foldr
- SKI in Qi's type system
- Haskell-like Type Classes in Qi
- Existential Data Constructors in Haskell and Qi
1.8 Scheme
1.9 XSLT
2 Theorem provers
2.1 Agda =
2.2 Coq
2.3 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#
- The New Lambda Expressions Feature in C# 3.0
- Immutability, Purity, and Referential Transparency in C#
- Haskell for C# 3 Programmers
- 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
4.4 C++
4.5 Eiffel
4.6 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
4.7 Scala
5 Imperative, dynamically typed
5.1 Javascript
5.2 Lua
5.3 Perl 6
5.4 Python
- Haskell versus Python
- Using Haskell in Python: haskellembed
- Understanding Monads Via Python List Comprehensions
