{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"analysis","owner":"math-comp","isFork":false,"description":"Mathematical Components compliant Analysis Library","allTopics":["coq","ssreflect","mathcomp","analysis"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":38,"issueCount":75,"starsCount":197,"forksCount":44,"license":"Other","participation":[3,6,21,7,6,6,6,12,18,2,0,4,2,6,4,2,27,16,10,1,3,0,2,1,4,1,4,8,6,3,4,7,0,0,3,0,3,7,0,3,2,2,2,4,4,9,11,0,5,3,2,3],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-14T08:31:49.926Z"}},{"type":"Public","name":"algebra-tactics","owner":"math-comp","isFork":false,"description":"Ring, field, lra, nra, and psatz tactics for Mathematical Components","allTopics":["proof-automation","ssreflect","mathcomp","elpi","coq"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":1,"issueCount":13,"starsCount":32,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-11T13:47:12.017Z"}},{"type":"Public","name":"mczify","owner":"math-comp","isFork":false,"description":"Micromega tactics for Mathematical Components","allTopics":["coq","proof-automation","ssreflect","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":0,"issueCount":4,"starsCount":23,"forksCount":8,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-11T13:34:04.432Z"}},{"type":"Public","name":"math-comp","owner":"math-comp","isFork":false,"description":"Mathematical Components","allTopics":["coq","ssreflect","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":40,"issueCount":104,"starsCount":573,"forksCount":112,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-13T22:30:14.982Z"}},{"type":"Public","name":"real-closed","owner":"math-comp","isFork":false,"description":"Theorems for Real Closed Fields","allTopics":["coq","ssreflect","mathcomp","real-closed-fields"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":2,"issueCount":5,"starsCount":13,"forksCount":11,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,3,2,0,0,0,0,0,0,0,0,0,0,0,0,2,1,1,0,0,1,2,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-14T21:40:31.251Z"}},{"type":"Public","name":"odd-order","owner":"math-comp","isFork":false,"description":"The formal proof of the Odd Order Theorem","allTopics":["coq","ssreflect","mathcomp","odd-order-theorem","feit-thompson-theorem"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":3,"issueCount":1,"starsCount":24,"forksCount":16,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-14T13:38:22.776Z"}},{"type":"Public","name":"bigenough","owner":"math-comp","isFork":false,"description":"Asymptotic reasoning with bigenough","allTopics":["coq","ssreflect","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":0,"issueCount":1,"starsCount":4,"forksCount":3,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-17T15:32:45.988Z"}},{"type":"Public","name":"Abel","owner":"math-comp","isFork":false,"description":"A proof of Abel-Ruffini theorem.","allTopics":["coq","ssreflect","galois-theory","abel-ruffini","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":9,"issueCount":1,"starsCount":28,"forksCount":8,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-19T11:39:03.009Z"}},{"type":"Public","name":"multinomials","owner":"math-comp","isFork":false,"description":"Multinomials for the Mathematical Components library.","allTopics":["polynomials","mathcomp","coq","ssreflect"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":3,"issueCount":2,"starsCount":14,"forksCount":12,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-15T12:11:05.181Z"}},{"type":"Public","name":"finmap","owner":"math-comp","isFork":false,"description":"Finite sets, finite maps, multisets and generic sets","allTopics":["coq","ssreflect","finite-sets","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":4,"issueCount":14,"starsCount":46,"forksCount":28,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-29T13:16:58.253Z"}},{"type":"Public","name":"trajectories","owner":"math-comp","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":4,"issueCount":8,"starsCount":0,"forksCount":4,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-31T14:17:27.354Z"}},{"type":"Public","name":"cad","owner":"math-comp","isFork":false,"description":"Formalizing Cylindrical Algebraic Decomposition related theories in mathcomp","allTopics":["coq","ssreflect","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":3,"issueCount":0,"starsCount":0,"forksCount":2,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-14T15:26:37.136Z"}},{"type":"Public","name":"Coq-Combi","owner":"math-comp","isFork":false,"description":"Algebraic Combinatorics in Coq","allTopics":[],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":1,"issueCount":1,"starsCount":34,"forksCount":7,"license":"GNU General Public License v3.0","participation":[0,0,0,0,0,0,0,0,0,0,0,0,10,11,8,3,1,0,10,12,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-11T20:34:19.678Z"}},{"type":"Public","name":"tutorial_material","owner":"math-comp","isFork":false,"description":"proof script associated to tutorial material","allTopics":[],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":0,"issueCount":1,"starsCount":17,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-29T01:50:42.936Z"}},{"type":"Public","name":"dioid","owner":"math-comp","isFork":false,"description":"A formalization of the algebraic structure of dioid and associated lemmas (including the Nerode lemma).","allTopics":["coq","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-08-02T11:11:32.201Z"}},{"type":"Public archive","name":"mathcomp-history-before-github","owner":"math-comp","isFork":false,"description":"The \"coqfinitgroup\" repository before the switch to github","allTopics":[],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":0,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-03-25T17:37:37.814Z"}},{"type":"Public","name":"newtonsums","owner":"math-comp","isFork":false,"description":"Newton series transformation","allTopics":["coq","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":1,"issueCount":0,"starsCount":0,"forksCount":3,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-11-10T23:12:23.909Z"}},{"type":"Public","name":"POPLmark","owner":"math-comp","isFork":false,"description":"Solutions for the POPLmark challenge","allTopics":["coq","ssreflect","mathcomp"],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":0,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-11-09T14:32:02.231Z"}},{"type":"Public","name":"pnp","owner":"math-comp","isFork":true,"description":"Lecture notes for a short course on proving/programming in Coq via SSReflect.","allTopics":[],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":16,"license":null,"participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2016-12-22T23:00:53.868Z"}}],"repositoryCount":19,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"math-comp repositories"}