SML libraries

These are the Standard ML libraries that are known to me. If you know of more please email me at magnus at hcoop.net and I will add them!

The link list and the software used to generate this page is kept in a darcs repository. To get a copy, run:

darcs get http://hcoop.net/~magnus/sml-libs

I will gladly accept patches!

Thanks to Lucas Dixon for submitting links.

• A Finite Automata Library for Standard ML

• A RegExp library
• A stream library
• A simple printf library
• The "nowhere" tool

• Gtk 1.2.x binding
• SDL binding
• SMPEG binding
• MySQL binding
• ncurses binding
• libxml, libxml2, libxslt bindings

• FGL - A Functional Graph Library

• Smldb - A set of database routines

• Web page template system
• SQL database interface to PostgreSQL

• Automatic testing library ala Haskell's QuickCheck

• Compatibility layer between various ML implementations
• Error handling framework
• Standard arithmetic signatures
• 2D and 3D Geometry library (points, vectors, rectangles, etc)
• 4x4 Matrix library
• Collections (ternary search tree)
• Converter from binary IEEE Reals to ML real values
• Functional input streams (text based and binary)
• Parsing toolkit for binary and text streams

• Util - general data structures like sets and maps
• Unix - system interfaces special to Unix
• INet - programming with sockets
• PP - pretty printing
• RegExp - regular expression pattern matching
• HTML - HTML parsing and processing
• Reactive - Sugarcube-like reactive programming

• lex
• yacc

• lots of things

• (a static version is also available from: http://isaplanner.svn.sourceforge.net/viewvc/isaplanner/trunk/isaplib/basic)
• pretty printing
• tables, queues, ordered lists, balanced trees, association lists, heaps
• paths, files, text buffers
• abstract history of actions with undos, redos etc
• xml
• urls
• unbounded integers
• combinator parsing
• lazy lists
• name spaces

• finite sets and tables of abstract names (ordered, with fresh name construct)
• binary relations, isomorphisms, automorphisms, mappings, and generic renaming.

• graph libraries

• rich circuit style graph library, with matching and rewriting
• graphs with boundaries
• expressions containing variables with multiplication and addition