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/
☆53Updated 5 months ago
Related projects ⓘ
Alternatives and complementary repositories for miranda
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated 9 months ago
- The Iowa Agda Library☆46Updated 5 months ago
- A ML-like pure functional language that can be used as a template for creating your own language☆27Updated last year
- Hope programming language interpreter☆40Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 4 months ago
- SKI combinators☆50Updated 7 years ago
- A self-hosting mini Haskell compiler with a mini C runtime.☆72Updated 4 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- The Twelf Programming Language☆108Updated 3 weeks ago
- ATS2: Unleashing the Potentials of Types and Templates☆41Updated 4 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…☆57Updated 3 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆28Updated 10 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- an implementation of stuck macros☆131Updated last week
- ☆16Updated 7 months ago
- source code for the bondi programming language☆38Updated 5 years ago
- A simple Prolog interpreter☆43Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A SKI combinators interpreter written in assembly☆17Updated 4 years ago
- Standard ML compiler based on typed intermediate languages.☆46Updated 10 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆27Updated 7 years ago
- Package manager for Idris☆35Updated 2 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆27Updated this week
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Fωμ type checker and compiler☆51Updated last year
- LLVM code generation in Haskell☆50Updated last week
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year