dmbaturin / hope
Hope programming language interpreter
☆40Updated 4 years ago
Alternatives and similar repositories for hope
Users that are interested in hope are comparing it to the libraries listed below
Sorting:
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆57Updated last year
- The Alms Programming Language☆44Updated 6 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆61Updated 3 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- SML Parser Combinator Library☆28Updated 9 years ago
- This repository contains coding examples of all sorts written in ATS and possibly other programming languages. These examples are primari…☆60Updated 4 years ago
- For parts of https://www.ats-lang.org☆27Updated this week
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 6 months ago
- Pretty-print error messages of the ATS Compiler☆35Updated 5 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 3 months ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- My Own Linear Lisp☆40Updated 6 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- higher order dependently typed logic programing☆171Updated 6 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- A bare-bones LCF-style proof assistant☆23Updated 5 years ago
- A simple Prolog interpreter☆42Updated 3 years ago
- Collection of ATS goodness☆35Updated 5 years ago
- An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)☆21Updated 6 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- minimalist polymorphic scheme-(co)monads, written to avoid use of any advanced language features except hygienic macros☆18Updated 12 years ago