Alternatives and similar repositories for xmonad:

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

• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆33Updated 8 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆54Updated 5 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• themattchan / haskell-tiger
  Modern compiler implementation in ML, in Haskell
  ☆16Updated 7 years ago
• UlfNorell / agda-summer-school
  Summer school on programming in Agda
  ☆68Updated last year
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last month
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆91Updated 7 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• bgamari / the-thoralf-plugin
  This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.
  ☆21Updated 3 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• andrejbauer / what-is-algebraic-about-algebraic-effects
  ☆46Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 4 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆87Updated 6 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆43Updated last month
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 7 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• LeventErkok / sbvPlugin
  Formally prove properties of Haskell programs using SBV/SMT.
  ☆45Updated last month
• JLimperg / cats
  Category Theory in Agda. Learning exercise, not for public consumption.
  ☆25Updated 5 years ago
• jwiegley / z3cat
  Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations
  ☆38Updated 7 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago