Blog articles/Mathematics

From HaskellWiki

Revision as of 01:40, 2 July 2007 (edit) DonStewart (Talk | contribs) ← Previous diff		Revision as of 02:52, 2 July 2007 (edit) (undo) DonStewart (Talk | contribs) (elaborate) Next diff →
Line 1:		Line 1:
-	Haskell and mathematics.	+	Articles using Haskell for mathematics, and the mathematics of Haskell.
	For further references see the:		For further references see the:
		+
	* [[Haskell_and_mathematics|Haskell math community]].		* [[Haskell_and_mathematics|Haskell math community]].
-	* [[Blog_articles/Monads]]	+	* [[Blog_articles/Monads|Mathematics of monads]]
	== Haskell for mathematics ==		== Haskell for mathematics ==

---

Revision as of 02:52, 2 July 2007

Articles using Haskell for mathematics, and the mathematics of Haskell.

For further references see the:

• Haskell math community.
• Mathematics of monads

Contents 1 Haskell for mathematics 1.1 General 1.2 Calculus and Differential Geometry 1.3 Algebraic Topology and Geometry 1.4 Geometry 1.5 Group theory 1.6 Set theory 1.7 Ring theory 1.8 Number theory 1.9 Cryptography and coding theory 1.10 Logic 1.11 Numerics 2 Theorem proving 3 Quantum computing 4 Mathematics of Haskell 4.1 Category theoretic 4.2 Lambda and combinator calculi 4.3 Other formal logics 4.4 Miscellaneous

1 Haskell for mathematics

1.1 General

• Eleven Reasons to use Haskell as a Mathematician
• Haskell for Maths: commutative algebra, combinatorics, number theory, and group theory libraries
• Learn Maths with Haskell
• Prototyping thought
• Why Haskell?

1.2 Calculus and Differential Geometry

• Practical Synthetic Differential Geometry
• Non-standard analysis, automatic differentiation, Haskell

1.3 Algebraic Topology and Geometry

• Algebraic Topology in Haskell
• More Low Cost Geometric Algebra
• Geometric Algebra for Free!

1.4 Geometry

• Haskell, PDF and penrose tilings

1.5 Group theory

• Computational Group Theory in Haskell
• Carry bits and group cohomology
• Monads from Algebra and the the Gray Code from Groups

1.6 Set theory

• Uncountable ordinals in Haskell
  • Part 1
  • Part 2
• Constructability, Uncountability, and -Haskell
• Defining a power set in one line

1.7 Ring theory

• Polynomials (update)

1.8 Number theory

• GCD and Higher Order Functions

1.9 Cryptography and coding theory

• Feistel Ciphers and DES in Haskell
• Arithmetic coding in Haskell
• Two-dimensional spatial hashing with space-filling curves

1.10 Logic

• Laws of Form: An Opinion

1.11 Numerics

• The Division Bell
  • Part One
  • Part Two
  • Part Three
  • Part Four (Conclusion)
  • The Divisive Aftermath

• Overloading Haskell numbers
  • Part 1: symbolic expressions
  • Part 2: Forward Automatic Differentiation
  • Part 3: Fixed Precision
  • Dynamic epsilons in Haskell with a bit of type hackery

2 Theorem proving

• Quick and Dirty Theorem Prover

3 Quantum computing

• The Essence of Quantum Computing
• Monads for vector spaces, probability and quantum mechanics pt. I
• Monads, Vector Spaces and Quantum Mechanics pt. II
• Independence, entanglement and decoherence with the quantum monad
• The Shor Quantum Error Correcting Code (and a Monad for Heat)
• The Frame Of Reference Monad

4 Mathematics of Haskell

4.1 Category theoretic

• Category Theory and the Category of Haskell programs:
  • Category Theory and the category of Haskell programs
  • Part 2

• Why isn't ListT list a monad?
• Reverse Engineering Machines with the Yoneda Lemma
• Variable substitution gives a...
• Games, Strategies and the Self-Composition of the List Monad.

4.2 Lambda and combinator calculi

• Programs are Proofs: Models and Types in Lambda Calculus
• Don't need the Y combinator

4.3 Other formal logics

• From Löb's Theorem to Spreadsheet Evaluation

4.4 Miscellaneous

• ML, Haskell and Coq
• Infinitesimal Types
• Djinn, Coq, Monad and a bit of Haskell

Categories: Tutorials | Mathematics