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
- For hosting certain parts of http://www.ats-lang.org☆27Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year
- Hope programming language interpreter☆40Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- The LC3 virtual machine☆23Updated 3 months ago
- A custom parser/auto-formatter for Standard ML☆75Updated last week
- ATS2: Unleashing the Potentials of Types and Templates☆42Updated 5 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- The Iowa Agda Library☆47Updated 3 months ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆61Updated 3 years ago
- SML reference interpreter☆112Updated last year
- TinyAPL, a tiny APL dialect and interpreter in Haskell☆52Updated this week
- The Caml Light implementation of the Caml language☆66Updated 2 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- The Twelf Programming Language☆121Updated last month
- Standard ML Parser Combinator Library☆15Updated 6 months ago
- an implementation of stuck macros☆139Updated last month
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- SKI combinators☆54Updated 7 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Anders: Cubical Type Checker☆23Updated last year
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 10 months ago