eliminators alternatives and similar packages

Based on the "Dependent Types" category.
Alternatively, view eliminators alternatives based on common mentions on social networks and blogs.

Agda

10.0 9.8 eliminators VS Agda

Agda is a dependently typed programming language / interactive theorem prover.
singletons

9.7 5.5 eliminators VS singletons

Fake dependent types in Haskell using singletons

Static code analysis for 29 languages.

Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

Promo www.sonarqube.org

cubical

9.4 0.0 eliminators VS cubical

Implementation of Univalence in Cubical Sets
hoq

8.9 0.0 eliminators VS hoq

A language based on homotopy type theory with an interval
helf

7.3 0.0 eliminators VS helf

Haskell implementation of the Edinburgh Logical Framework
open-typerep

4.2 0.0 eliminators VS open-typerep

Open type representations and dynamic types
agda-snippets

4.2 0.0 eliminators VS agda-snippets

Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.
Sit

3.9 0.0 eliminators VS Sit

Prototypical type checker for Type Theory with Sized Natural Numbers