logict-sequence
egg
| logict-sequence | egg | |
|---|---|---|
| 2 | 25 | |
| 9 | 1,252 | |
| - | 3.1% | |
| 0.0 | 6.8 | |
| over 1 year ago | 28 days ago | |
| Haskell | Rust | |
| MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
logict-sequence
-
I tried learning haskell by writing a chess engine
I took the code from that paper and cleaned it up a bit and put it on hackage. The constant factors there are not great, but the version on github (I really need to cut a new release) has greatly improved constant factors and is quite competitive with the original LogicT while avoiding the quadratic slowdown. You can get it here if you want to try it: https://github.com/dagit/logict-sequence
- Ever wondered how fusion works? I have some links for you.
egg
-
An Introduction to Graph Theory
Maybe program optimization?
https://egraphs-good.github.io/
- The E-graph extraction problem is NP-complete
-
What is the state of the art for creating domain-specific languages (DSLs) with Rust?
For semantic analyzers, check out egg and egglog. They're custom data structures for representing compiler rewrite rules in a non-destructive way.
-
Ask HN: What is new in Algorithms / Data Structures these days?
E-graphs are pretty awesome, and worth keeping in your back pocket. They're like union-find structures, except they also maintain congruence relations (i.e. if `x` and `y` are in the same set, then `f(x)` and `f(y)` must likewise be in the same set).
https://egraphs-good.github.io/
(Incidentally, union-find structures are also great to know about. But they're not exactly "new".)
-
What are the current hot topics in type theory and static analysis?
I would add that Equality saturation/E-graphs has become quite a hot topic recently, since their POPL21 paper, with workshops dedicated to applications of e-graphs. They have even recently been added to Cranelift as an IR for optimizations.
-
Compiler Optimizations Are Hard Because They Forget
Egraphs solve the rewrite ordering problem quite nicely. https://egraphs-good.github.io/
Note that one solution to this problem is to use equality saturation (which, coincidentally, has a great implementation in rust!).
-
Modularity in IR representation and modification
Have you thought about trying to parallelize e-graphs? This way you can do a bunch of rewrite rules in parallel and then extract your desired graph at the end instead of having conflicts.
-
Any recommendations for good resources that show how algorithms and data structures are converted into fpga circuits
I think the equality saturation papers are a good start. A good start is egg. They have a presentation, a research paper and code you can play with. I think ultimately you want to translate arithmetic operations into logical operation that can be understood by the fpga. So I think it would be good to research how adders and multipliers are implemented in logic and ultimately include equalities between adders/multipliers with their logical counterpart. Note the this translation also depends on the representations of your numbers and their bit width.
-
Strategies for doing symbolic integration algorithmically
For rewriting, you may also find interesing equality saturation: https://egraphs-good.github.io/
What are some alternatives?
awesomo - Cool open source projects. Choose your project and get involved in Open Source development now.
prose - Microsoft Program Synthesis using Examples SDK is a framework of technologies for the automatic generation of programs from input-output examples. This repo includes samples and sample data for the Microsoft Program Synthesis using Example SDK.
pandoc - Universal markup converter
Symbolics.jl - Symbolic programming for the next generation of numerical software
purescript - A strongly-typed language that compiles to JavaScript
Catlab.jl - A framework for applied category theory in the Julia language
hadolint - Dockerfile linter, validate inline bash, written in Haskell
Dagger.jl - A framework for out-of-core and parallel execution
Chesskell
glow - Compiler for Neural Network hardware accelerators
postgrest - REST API for any Postgres database
StaticArrays.jl - Statically sized arrays for Julia