Open Issues Need Help
View All on GitHub good first issue research
An optimizing compiler that chooses your algorithm from intent, and proves it correct. Describe what you want; it picks heap vs sort, BFS vs Dijkstra, Kadane, and more.
Python
#algorithms#compiler#language-design#llvm#optimizer#programming-language#pyodide#python
Research: journal one Window problem by the ritual about 2 months ago
good first issue research
An optimizing compiler that chooses your algorithm from intent, and proves it correct. Describe what you want; it picks heap vs sort, BFS vs Dijkstra, Kadane, and more.
Python
#algorithms#compiler#language-design#llvm#optimizer#programming-language#pyodide#python
Research: 3Sum as the third Relation data point (the deciding experiment) about 2 months ago
good first issue research
An optimizing compiler that chooses your algorithm from intent, and proves it correct. Describe what you want; it picks heap vs sort, BFS vs Dijkstra, Kadane, and more.
Python
#algorithms#compiler#language-design#llvm#optimizer#programming-language#pyodide#python