diku-dk / sml-parseLinks
Standard ML Parser Combinator Library
☆16Updated last year
Alternatives and similar repositories for sml-parse
Users that are interested in sml-parse are comparing it to the libraries listed below
Sorting:
- ML Basis for Poly/ML☆11Updated last month
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Grab-bag library for the MPL compiler (https://github.com/mpllang/mpl)☆21Updated last month
- Signature documentation tool for Standard ML☆14Updated 2 years ago
- The Caml Light implementation of the Caml language☆67Updated 2 years ago
- Web server infrastructure for Standard ML☆15Updated 2 years ago
- A custom parser/auto-formatter for Standard ML☆83Updated 3 months ago
- HTTP utility library for Standard ML☆11Updated 2 years ago
- Tutorial for using the MPL compiler for Parallel ML☆22Updated 10 months ago
- SML reference interpreter☆119Updated last month
- Standard ML compiler based on typed intermediate languages.☆49Updated 11 years ago
- A basic library of algorithms and data structures (a la NJlib)☆75Updated 7 months ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆64Updated 3 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- MLB support for CM (the SML/NJ Compilation and Library Manager)☆18Updated 5 months ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- Smackage Package Manager for Standard ML☆124Updated 3 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆37Updated 3 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆60Updated 5 months ago
- ☆45Updated 7 months ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- The opentheory tool processes higher order logic theory packages☆16Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆99Updated last month
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆103Updated 6 months ago
- Standard ML Infrastructure for writing LSP servers☆14Updated last year
- Dromedary is an experimental subset of OCaml, using constraint-based type inference!☆48Updated last month
- A toy language based on LLVM that implements the System Fω type-system☆112Updated 2 years ago
- ☆45Updated 2 months ago