ncihnegn / miranda
Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://codesync.global/media/open-sourcing-miranda-david-turner-code-mesh-v-2020-codemeshv2020/
☆57Updated 10 months ago
Alternatives and similar repositories for miranda:
Users that are interested in miranda are comparing it to the libraries listed below
- Hope programming language interpreter☆40Updated 4 years ago
- Anders: Cubical Type Checker☆24Updated last year
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- Specification of the Cedille Core language☆29Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 3 months ago
- A toy dependent typed language.☆28Updated last week
- The Iowa Agda Library☆47Updated 4 months ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- The LC3 virtual machine☆23Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- This repository contains coding examples of all sorts written in ATS and possibly other programming languages. These examples are primari…☆59Updated 4 years ago
- ATS2: Unleashing the Potentials of Types and Templates☆42Updated 5 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Package manager for Idris☆35Updated 2 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- ☆17Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- For supporting template-based programming☆21Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago