GitHub / luizaugustogarcia / euclidean-algorithm
Demonstration, in Coq, that the Euclidean Algorithm can be efficiently used to compute the greatest common divisor of two numbers
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luizaugustogarcia%2Feuclidean-algorithm
PURL: pkg:github/luizaugustogarcia/euclidean-algorithm
Stars: 0
Forks: 0
Open issues: 0
License: apache-2.0
Language: Makefile
Size: 19.5 KB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: over 2 years ago
Pushed at: over 2 years ago
Last synced at: over 2 years ago
Topics: coq-formalization, formal-methods
Loading...