Alternatives and similar repositories for absal-ex:

Users that are interested in absal-ex are comparing it to the libraries listed below

• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• VictorTaelin / absal-rs
  ☆35Updated 6 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 11 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 7 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 4 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• gergoerdi / interaction-nets
  Haskell implementation of interaction net-based lambda evaluation
  ☆19Updated 8 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆81Updated last year
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• VictorTaelin / formality-agda-lib-legacy
  Agda libraries relevant to Moonad
  ☆14Updated 5 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆49Updated 2 months ago
• moonad-archive / Formality-JavaScript
  An implementation of the Formality language in JavaScript
  ☆71Updated 5 years ago
• vmchale / atspkg
  Build tool for ATS.
  ☆41Updated 2 years ago
• chrisdone-archive / prana
  Interpreter for GHC Haskell
  ☆22Updated 5 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 8 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 3 months ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 6 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• VictorTaelin / parallel_lambda_computer_tests
  learning cuda
  ☆18Updated 8 years ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated 4 months ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week