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 7.0 eliminators VS singletons

Fake dependent types in Haskell using singletons

CodeRabbit: AI Code Reviews for Developers

Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.

Promo coderabbit.ai

cubical

9.4 0.0 eliminators VS cubical

Implementation of Univalence in Cubical Sets
hoq

9.0 0.0 eliminators VS hoq

A language based on homotopy type theory with an interval
helf

7.3 2.9 eliminators VS helf

Haskell implementation of the Edinburgh Logical Framework
agda-snippets

4.6 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.8 3.0 eliminators VS Sit

Prototypical type checker for Type Theory with Sized Natural Numbers
open-typerep

3.8 0.0 eliminators VS open-typerep

Open type representations and dynamic types