ngzhian / skiLinks
SKI combinators
☆55Updated 8 years ago
Alternatives and similar repositories for ski
Users that are interested in ski are comparing it to the libraries listed below
Sorting:
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆57Updated last week
- Bologna Optimal Higher-Order Machine, Version 1.1☆72Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ☆43Updated 3 years ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆117Updated 4 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆80Updated 3 years ago
- ☆35Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks 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 pure type system implemented in OCaml☆77Updated 4 years ago
- A collection of programming languages and type systems.☆33Updated 3 weeks ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- A Pascal to LLVM compiler in Haskell☆126Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆114Updated this week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A simple Prolog interpreter☆42Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago