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…
  ☆57Updated 10 months ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆79Updated 3 years ago
• sergei-romanenko / spsc
  SPSC: A Small Positive Supercompiler
  ☆34Updated 10 months ago
• jsiek / B629-denotational
  Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
  ☆72Updated 6 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 9 months ago
• jmorag / mcc
  MicroC example compiler for Stephen Edward's PLT class, but in Haskell
  ☆117Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆56Updated 11 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• ayazhafiz / plts
  A collection of programming languages and type systems.
  ☆33Updated 7 months ago
• Lysxia / advent-of-coq-2021
  ☆40Updated 3 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last month
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆67Updated last month
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated 2 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• jdan / compiler.lean
  A formally verified compiler for a simple language with numbers and sums
  ☆27Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 3 years ago
• rossberg / hamlet
  SML reference interpreter
  ☆112Updated last year
• Ekdohibs / joujou
  A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …
  ☆89Updated 6 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆70Updated 8 years ago
• ats-lang / ATS-CodeBook
  This repository contains coding examples of all sorts written in ATS and possibly other programming languages. These examples are primari…
  ☆59Updated 4 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• jdreaver / amy
  Strict Haskell-like programming language that compiles to LLVM
  ☆70Updated 5 years ago
• ilya-klyuchnikov / ttlite
  A SuperCompiler for Martin-Löf's Type Theory
  ☆120Updated 3 years 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.
  ☆81Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆139Updated last week