Trending repositories

Ranked by Attention Score: stars gained over the last 90 complete days

Period

Sort order

Tags: Programming languages and compilers

1.rocq-prover / rocq

The Rocq Prover is an interactive theorem prover, or proof assistant. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.

proof-assistant
coq
theorem-proving
dependent-types

OCaml LGPL-2.15.7K total771 forks

+142 stars

from 5,516 · score 4.96

2.videolan / libvlcsharp

Cross-platform .NET/Mono bindings for LibVLC

dotnet
vlc
multimedia
xamarin
libvlc
player
+2 more

C#LGPL-2.11.8K total303 forks

+36 stars

from 1,793 · score 3.61

3.LPCIC / coq-elpi

Rocq plugin embedding Elpi

coq
metaprogramming
extension-language
lambda-prolog
scripting

OCaml LGPL-2.1198 total81 forks

+7 stars

from 191 · score 2.08

4.oaubert / python-vlc

Python vlc bindings

Python LGPL-2.1447 total118 forks

+4 stars

from 443 · score 1.61

5.BeRo1985 / besen

Complete ECMAScript Fifth Edition Implemention in Object Pascal

Pascal LGPL-2.1233 total49 forks

+4 stars

from 229 · score 1.61

6.rocq-prover / equations

A function definition package for Rocq

coq
programming-language
dependent-types
rocq

Rocq Prover LGPL-2.1239 total58 forks

+3 stars

from 236 · score 1.39

7.affeldt-aist / monae

Monadic effects and equational reasoning in Rocq

monads
monad-transformers
probabilistic-programming
nondeterminism
mathcomp
ssreflect
+2 more

Rocq Prover LGPL-2.178 total19 forks

+2 stars

from 76 · score 1.10

8.cardmagic / simple-rss

A simple, flexible, extensible, and liberal RSS and Atom reader for Ruby. It is designed to be backwards compatible with the standard RSS parser, but will never do RSS generation.

Ruby LGPL-2.1230 total64 forks

+1 stars

from 229 · score 0.69

9.SimonKagstrom / cibyl

A MIPS to Java bytecode binary translator

C LGPL-2.170 total13 forks

+1 stars

from 69 · score 0.69

Order: Attention Score

Most net stars gained in the window first. The score only puts this gain on a log scale, so the order is the order of the gain.

How the ranking works

Ranked by stars gained in the window. The score is the natural log of one plus that gain, so a repository's rank is exactly its star gain's rank.

score = log1p(net stars gained in the trailing T complete UTC days)

A repository is ranked only when its Star History covers every day of the window and its latest Observation is not missing.

The longest window is 180 days. Star History from the Repository Host goes back at most 180 days before the first daily record that AwesomeRepos made for the repository. A longer window needs more of these daily records first. A repository younger than the window does not rank in it.

The filters select from the same eligible repositories. A repository matches the topics when it has any of them. Total stars is the count now. Last push and creation on the Repository Host count back from the start of today (UTC). The counts beside the languages, licenses, and topics include all ranked repositories in the window. A Tag holds the repositories that have it. See Tags.

A new repository enters the index when it gains stars faster than the published admission threshold, whatever its size. A repository stays in the index after it enters. Thus an archived repository can still rank.

Browse the Repository Index