Barry-Jay / bondiLinks
source code for the bondi programming language
☆40Updated 6 years ago
Alternatives and similar repositories for bondi
Users that are interested in bondi are comparing it to the libraries listed below
Sorting:
- A nano "theorem prover".☆62Updated 6 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- The Alms Programming Language☆44Updated 7 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- higher order dependently typed logic programing☆174Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆49Updated 5 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- Kempe is a compiled stack-based language☆58Updated 11 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- MetaML and MetaOCaml bibliography☆93Updated 9 months ago
- Logic for story telling!☆34Updated 7 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- Standard ML compiler based on typed intermediate languages.☆48Updated 11 years ago
- A simple Prolog interpreter☆42Updated 3 years ago
- An extended typed Lambda Calculus☆21Updated last year
- Yes, it is what you think it is☆33Updated 9 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 7 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- Hindley-Milner type inference using constraints