ncihnegn / mirandaLinks
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 last week
Alternatives and similar repositories for miranda
Users that are interested in miranda are comparing it to the libraries listed below
Sorting:
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Anders: Cubical Type Checker☆24Updated last year
- Hope programming language interpreter☆40Updated 4 years ago
- ATS2: Unleashing the Potentials of Types and Templates☆43Updated 5 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- The Iowa Agda Library☆47Updated 5 months ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- A SKI combinators interpreter written in assembly☆19Updated 4 years ago
- A toy dependent typed language.☆28Updated last week
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 4 months ago
- A self-hosting mini Haskell compiler with a mini C runtime.☆75Updated 5 years ago
- This repository contains coding examples of all sorts written in ATS and possibly other programming languages. These examples are primari…☆61Updated 4 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- an implementation of gradual typing in mit-scheme☆9Updated 4 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A core concatenative programming language with variables and first-rank polymorphic type inference☆31Updated 5 years ago
- SKI combinators☆54Updated 8 years ago
- an implementation of stuck macros☆142Updated 2 months ago
- Package manager for Idris☆35Updated 2 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆62Updated 3 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆29Updated 7 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- SML reference interpreter☆116Updated 2 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- The Caml Light implementation of the Caml language☆68Updated 2 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆30Updated last year
- SPSC: A Small Positive Supercompiler☆35Updated last year
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- 🪆 A Staged Type Theory☆35Updated last year