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/
☆60Updated 4 months ago
Alternatives and similar repositories for miranda
Users that are interested in miranda are comparing it to the libraries listed below
Sorting:
- Hope programming language interpreter☆42Updated 4 months ago
- A custom parser/auto-formatter for Standard ML☆83Updated 2 months ago
- SML reference interpreter☆117Updated 2 months ago
- Mirror of Epigram 2, by Conor McBride, et al.☆54Updated 5 years ago
- ATS2: Unleashing the Potentials of Types and Templates☆45Updated 5 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Pretty-print error messages of the ATS Compiler☆37Updated 6 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆37Updated last month
- The Caml Light implementation of the Caml language☆67Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- a self-hosting lambda calculus compiler☆37Updated 6 months ago
- A self-hosting mini Haskell compiler with a mini C runtime.☆76Updated 5 years ago
- SKI combinators☆55Updated 8 years ago
- Useful things for Standard ML☆69Updated last year
- Bologna Optimal Higher-Order Machine, Version 1.1☆77Updated 8 years ago
- Admiran is a pure, lazy, functional language and self-hosting compiler based upon Miranda☆81Updated this week
- The Twelf Programming Language☆145Updated last week
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- an implementation of stuck macros☆146Updated 3 weeks ago
- This repository contains coding examples of all sorts written in ATS and possibly other programming languages. These examples are primari…☆62Updated 4 years ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆119Updated 4 years ago
- higher order dependently typed logic programing☆174Updated 7 years ago
- Haskell User's Gofer System☆27Updated 9 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆29Updated 9 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Updated 7 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- source code for the bondi programming language☆41Updated 6 years ago