Alternatives and similar repositories for ski

Users that are interested in ski are comparing it to the libraries listed below

• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆60Updated 5 months ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆81Updated 8 years ago
• jmorag / mcc
  MicroC example compiler for Stephen Edward's PLT class, but in Haskell
  ☆119Updated 4 years ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆41Updated 6 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 7 months ago
• mit-plv / timl
  TiML: A Functional Programming Language with Time Complexity
  ☆80Updated 8 years ago
• techcentaur / Krivine-Machine
  Abstract krivine machine implementing call-by-name semantics. In OCaml.
  ☆45Updated 7 years ago
• ayazhafiz / plts
  A collection of programming languages and type systems.
  ☆33Updated 5 months ago
• wilbowma / pl-thesaurus
  ☆89Updated 4 years ago
• astampoulis / makam
  The Makam Metalanguage
  ☆200Updated 2 years ago
• standardml / twelf
  The Twelf Programming Language
  ☆145Updated last week
• dmbaturin / hope
  Hope programming language interpreter
  ☆42Updated 5 months ago
• namin / metaprogramming
  Course on Metaprogramming
  ☆72Updated 4 months ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• siraben / mini-haskell
  A self-hosting mini Haskell compiler with a mini C runtime.
  ☆76Updated 5 years ago
• ilya-klyuchnikov / sc-mini
  SC Mini is a "minimal" positive supercompiler
  ☆46Updated 4 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆55Updated 5 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated last year
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆29Updated 9 months ago
• jdan / compiler.lean
  A formally verified compiler for a simple language with numbers and sums
  ☆27Updated 4 years ago
• siraben / r5rs-denot
  A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.
  ☆21Updated 5 months ago
• kmicinski / cmsc330examples
  Examples from the class CMSC 330 during Summer 2015
  ☆49Updated 10 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• bor0 / gidti
  Book: Introduction to Dependent Types with Idris
  ☆78Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year