plum-umd / adaptonLinks
Adapton Project Homepage
☆16Updated 9 years ago
Alternatives and similar repositories for adapton
Users that are interested in adapton are comparing it to the libraries listed below
Sorting:
- A lazy specializing virtual machine for purely functional languages☆103Updated 7 years ago
- ☆41Updated 11 years ago
- APL compiler written in Standard ML☆36Updated 5 years ago
- PeaCoq is a pretty Coq, isn't it?☆105Updated 4 years ago
- An Interpreter for Extended Relational Algebra (Scheme based)☆84Updated 9 years ago
- MLton with Realtime GC and Threading features☆103Updated last year
- OCaml implementation of the K 2.0 array programming language☆81Updated 9 years ago
- [toy] A rewriting language similar to the core of Mathematica☆53Updated 3 years ago
- A small implementation of type inference☆80Updated 10 years ago
- A compiler for Crisp (Lisp/Scheme-inspired language) in Haskell, with an LLVM backend☆100Updated 9 years ago
- An OCaml/Mirage-friendly implementation of the 9P protocol☆67Updated 5 months ago
- Datalog implementation in Haskell. Experimental proving ground for knowledge-base ideas.☆23Updated 7 years ago
- [Deprecated see github.com/janestreet/hardcaml] Register Transfer Level Hardware Design in OCaml☆119Updated 5 years ago
- ☆40Updated 9 years ago
- Using QuickCheck to test functions in other languages/environments.☆33Updated 10 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Updated last year
- Demo of Ken Thompson's Reflections on Trusting Trust as a tiny lisp compiler☆97Updated 10 years ago
- ☆33Updated 10 years ago
- Classroom demonstration of costly state verification in finance☆16Updated 10 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- The Kleenex programming language☆56Updated last year
- Notes on P-omega☆14Updated 8 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- A simulator for visualising the evolution of π-calculus terms☆42Updated 3 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 10 years ago
- MLton for scalable multicore architectures☆59Updated 11 years ago
- A formalization of category theory in the Coq proof assistant.☆100Updated last year
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- ☆13Updated 11 years ago
- ☆60Updated 6 years ago