Alternatives and similar repositories for ski:

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

• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆79Updated 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
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆56Updated 9 months ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 4 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• jmorag / mcc
  MicroC example compiler for Stephen Edward's PLT class, but in Haskell
  ☆116Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆66Updated this week
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆57Updated 9 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆69Updated 8 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated last year
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆138Updated this week
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• jsiek / B629-denotational
  Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
  ☆72Updated 6 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆59Updated 7 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆109Updated this week
• ayazhafiz / plts
  A collection of programming languages and type systems.
  ☆33Updated 6 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 8 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 3 months ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last week
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• 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
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆40Updated 6 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago