taolson / AdmiranLinks
Admiran is a pure, lazy, functional language and self-hosting compiler based upon Miranda
☆72Updated this week
Alternatives and similar repositories for Admiran
Users that are interested in Admiran are comparing it to the libraries listed below
Sorting:
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆62Updated last year
- A general purpose statically-typed concatenative programming language.☆54Updated 2 years ago
- Programming with pure lambda calculus☆117Updated last week
- Fir programming language☆64Updated last week
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆55Updated last week
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆60Updated 3 months ago
- A garden of small programming language implementations 🪴☆277Updated last week
- A custom parser/auto-formatter for Standard ML☆79Updated last week
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆30Updated last week
- A toy dependent typed language.☆31Updated 2 weeks ago
- Demo for dependent types + runtime code generation☆70Updated 6 months ago
- The adventures of a Haskell compiler☆230Updated 3 months ago
- A tiny lazy objective functional language☆18Updated 11 months ago
- A call-by-need statically-duck-typed language named for French mathematician Sophie Germain☆32Updated 7 months ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆41Updated 8 months ago
- Staged compilation with dependent types☆179Updated 3 months ago
- Pretty-print error messages of the ATS Compiler☆37Updated 6 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆75Updated 8 years ago
- an implementation of stuck macros☆145Updated 2 weeks ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆118Updated 4 years ago
- Lambda Calculus Core! A collaborative effort at showing how the core of lambda calculus can be implemented in every programming language.☆45Updated 6 months ago
- The Twelf Programming Language☆141Updated 6 months ago
- A declarative concatenative programming language☆165Updated 10 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Pure functional programming with whole-program mutability inference☆74Updated 3 weeks ago
- WIP stack language that uses regex for control flow☆42Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A bidirectional type checker☆63Updated 8 years ago
- SKI combinators☆55Updated 8 years ago