Welcome to my first ever blog site. I'll be uploading anything of interest that I find or make.
In the mean time, please buy a few copies of my OCaml book:
http://www.ffconsultancy.com/products/ocaml_for_scientists/index.html
3 weeks ago
Links
- Visual F# 2010 for Technical Computing (book)
- The F#.NET Journal (on-line magazine)
- F# for Visualization (library)
- F# for Numerics (library)
- The OCaml Journal (on-line magazine)
- OCaml for Scientists (book)
- High-Level Virtual Machine (HLVM)
- FFT .NET (library)
- Time-Frequency Analysis (Mathematica library)
- Smoke Vector Graphics (OCaml library)
- F# for Scientists (book)
- OCaml demos
- Libraries by Jean-Christophe Filliatre
- Libraries by Markus Mottl
- FFTW3 interface by Christophe Troestler
- Ray tracer language comparison
Popular Posts
-
Erick Tryzelaar has done a fantastic job translating the LLVM tutorials from C++ to OCaml . The fruits of his labor are available here . Th...
-
We have collated a list of the world's most popular Linux software written in OCaml based upon the Debian and Ubuntu package popularity...
-
Middle-class white-collar American computer programmers are feeling the squeeze again today, and its not from Sharon in accounts. Only mont...
-
The OCaml Journal just published an article describing the use of labeled and optional function arguments: "The OCaml programming lang...
-
Philippe Wang made the exciting announcement recently that the first working version of oc4mc , OCaml with a new parallel garbage collector...
-
The OCaml Journal just published an article about compiler writing: "This article is the first in a series examining the design and co...
-
I just stumbled upon an exciting new project that revitalises the use of OpenGL from OCaml: GLCaml Hopefully this project will catch on a...
-
The OCaml Journal just published an article about the compilation of bytecodes: "The Low-Level Virtual Machine (LLVM) provides the mac...
-
The IT Jobs Watch website shows that the number of job advertisements citing OCaml is at its highest level ever:
-
The One Pot Application (OPA) from MLState is a complete development platform for web applications and services: Development in OPA require...
Follow by Email
Related Blogs
-
Visualizing transistor characteristics with Arduino and F# - The F#.NET Journal just published an article about electronics: *"The Arduino is a popular family of hobbyist microcontroller boards. These devices make it ...
-
Curious about the hash table problem - An old post from Stack Overflow: In short, even with the fix in the latest GHC, Haskell is still incapable of providing a dictionary (mutable or immutable...4 months ago
Subscribe
Posts
Comments
Labels
- 2d (1)
- 3.11 (1)
- a* algorithm (1)
- adaptive subdivision (1)
- advi (1)
- allocate (1)
- allocation (3)
- amd (1)
- apple store (1)
- architecture (1)
- array (1)
- articles (6)
- artificial intelligence (2)
- async (1)
- asynchronous (1)
- atomic structure (1)
- back propagation (1)
- balanced tree (1)
- batteries (2)
- beginner (1)
- benchmark (4)
- best fit (1)
- binary format (1)
- binary tree (1)
- boehm (1)
- boids (1)
- book (4)
- books (5)
- bounds checking (1)
- boxing (1)
- burrows wheeler (1)
- bwt (1)
- bzip2 (1)
- c (3)
- c++ (3)
- calculator (3)
- camlimages (1)
- camlp4 (2)
- catenable lists (1)
- character (1)
- chart (1)
- chess (1)
- cilk (1)
- citrix (3)
- classes (1)
- closures (2)
- combinatorial (1)
- combinators (3)
- commercial (1)
- commercial applications (1)
- common subexpression elimination (1)
- community (1)
- comparison (2)
- compilation (1)
- compiler (13)
- compiler options (1)
- complex numbers (1)
- computer (1)
- concurrent (4)
- concurrent gc (1)
- conference (1)
- continuation (1)
- convolution (1)
- correctness (2)
- covariance (1)
- crawler (1)
- curried functions (2)
- data compression (3)
- data representation (1)
- data structure (3)
- debian (1)
- debugging (1)
- deletion (1)
- dell (1)
- depth-first search (1)
- derivatives (1)
- design patterns (1)
- developers (1)
- diff (1)
- dijkstra (1)
- divide and conquer (1)
- division (1)
- dynamic programming (1)
- dynamic typing (1)
- dynamics (1)
- edit distance (1)
- eigenvalues (1)
- emergent behaviour (1)
- erlang (2)
- error (1)
- examples (3)
- f# (6)
- f#.net (1)
- f#.net journal (1)
- fast fourier transform (1)
- ffi (4)
- fft (2)
- fftw (1)
- finance (2)
- finite element (1)
- first-class modules (1)
- first-class structs (1)
- floating point (1)
- flocking (1)
- fluid dynamics (1)
- foreign function interface (1)
- fork (2)
- formal verification (1)
- freetennis (1)
- function pointers (2)
- functional programming (6)
- functor (1)
- functors (1)
- game (3)
- garbage collection (2)
- garbage collector (7)
- gauss siedel (1)
- geographic information systems (1)
- geometry (1)
- gis (1)
- glsl (2)
- google trend (1)
- gouraud (1)
- grad (1)
- gradient descent (1)
- graph (2)
- graph theory (2)
- graphics (13)
- gtk (5)
- gtk+ (1)
- gui (3)
- hash table (1)
- haskell (4)
- heap (3)
- hevea (1)
- higher-order functions (1)
- higher-order module (1)
- hindley-milner (1)
- hlvm (11)
- hoisting loop invariants (1)
- huffman (1)
- ide (1)
- incremental (1)
- industry (5)
- inlining (1)
- insertion (1)
- int (1)
- intel (1)
- interface (1)
- interpreter (4)
- ipad (1)
- jacobi (1)
- james woodyatt (1)
- jane st capital (2)
- java (3)
- jit (3)
- job (1)
- jobs (3)
- join calculus (1)
- journal (3)
- knights tour (1)
- labeled arguments (1)
- lablgtk2 (2)
- language (1)
- lazy (1)
- lazy pattern (2)
- leak (1)
- least squares (1)
- ledit (1)
- lempel ziv welch (1)
- levenshtein (1)
- lex (2)
- lexing (3)
- libraries (1)
- library (4)
- lighting (1)
- linear algebra (2)
- linux (1)
- lisp (6)
- list (1)
- lists (2)
- LL (1)
- lllvm (1)
- llvm (10)
- lock (1)
- logic (1)
- logic programming (1)
- longest common subsequence (1)
- low-level (1)
- lu decomposition (1)
- lwt (1)
- lzw (1)
- machine learning (1)
- macro (1)
- magazine (1)
- major heap (1)
- mark-sweep (2)
- maze (2)
- median (1)
- meeting (1)
- memoization (1)
- memory (2)
- mesh (1)
- metaocaml (1)
- metaprogramming (1)
- metric (1)
- minimization (1)
- minor heap (1)
- ml (1)
- mldonkey (1)
- mlstate (1)
- modulo (1)
- moving average (1)
- mtasc (1)
- multicore (2)
- mutex (3)
- mylife (1)
- native-code (1)
- navier stokes (1)
- network (3)
- neural network (1)
- non-uniform type (1)
- numerical (4)
- numerical integration (1)
- numerical methods (2)
- numerics (1)
- o'reily (1)
- oberon-2 (1)
- object oriented (2)
- objsize (1)
- oc4mc (2)
- ocaide (1)
- ocaml (67)
- ocaml 3.12 (2)
- ocaml for scientists (6)
- ocaml internals (1)
- ocaml journal (16)
- ocamlnet (1)
- oni (1)
- opa (1)
- opengl (14)
- opengl 2 (2)
- opteron (1)
- optimization (7)
- optional arguments (1)
- packages (1)
- parallel (9)
- parallel gc (2)
- parser (4)
- parsing (4)
- partition (1)
- pattern matching (6)
- pdf (1)
- performance (17)
- perl (1)
- persistence (1)
- phong (1)
- physics (1)
- planets (1)
- polygen (1)
- polymorphic recursion (1)
- polymorphic variants (1)
- popularity (2)
- posix (1)
- poster (1)
- postscript (1)
- power set (1)
- preconditioner (1)
- pretty printer (1)
- price (1)
- pricer (1)
- priority queue (1)
- product (1)
- profiling (1)
- profit (1)
- proper tail recursion (1)
- purely functional data structures (2)
- puzzle (1)
- pythagoras (1)
- pythagorean triplets (1)
- python (2)
- QR decomposition (1)
- queens (1)
- queens problem (2)
- queues (1)
- quicksort (1)
- random number (1)
- randomized algorithm (1)
- ray tracer (4)
- real time (1)
- recursion (3)
- recursive descent (3)
- recursive modules (1)
- reference type (1)
- regex (1)
- regexp (1)
- regular expression (1)
- release (4)
- reliability (1)
- remote procedure call (1)
- rendering (1)
- revenue (1)
- review (5)
- rigid body (2)
- roam (1)
- route finding (1)
- rtin (1)
- ruby (3)
- run-time code generation (3)
- salary (1)
- sales (1)
- scalability (1)
- scheme (5)
- school (1)
- scimark (1)
- search (1)
- semi-numerical methods (1)
- set (2)
- shader (2)
- shading (1)
- shadow stack (1)
- shared memory (1)
- shootout (1)
- shortest path (1)
- SICP (1)
- simple (1)
- simulated annealing (1)
- simulation (3)
- singular value decomposition (1)
- size (1)
- sliding window (1)
- sml (2)
- software (1)
- sort (2)
- sorting (1)
- source code (2)
- sparse matrix (2)
- special offer (1)
- standard library (1)
- stanford bunny (1)
- static typing (1)
- stop-the-world (1)
- streams (2)
- string (3)
- subscription (1)
- substitution (1)
- subtyping (1)
- success stories (1)
- sudoku (1)
- summer project (1)
- svd (1)
- svg (1)
- swarm (1)
- symbolic (2)
- syntax extension (1)
- tail call elimination (1)
- tail recursion (1)
- term rewriting (1)
- term-level (1)
- text (1)
- threads (4)
- top-level (2)
- traveling salesman (1)
- tree (1)
- trie (1)
- tuples (2)
- tutorial (1)
- tutorials (2)
- type checking (1)
- type inference (1)
- type system (1)
- ubuntu (1)
- uniform representation (1)
- union (1)
- union type (1)
- unison (1)
- unix systems programming in ocaml (1)
- unrolling (1)
- value type (1)
- variant type (2)
- vector (1)
- vector graphics (1)
- video (1)
- virtual machine (2)
- visualization (12)
- wavelet (1)
- web (1)
- web interface (1)
- web service (1)
- word (1)
- xensource (2)
- xml (1)
- xml-light (1)
- xmlrpc (1)
- yacc (1)
About Me
- Jon Harrop
- Specialist in the use of functional programming for technical computing in industry and academia.
No comments:
Post a Comment