Discovering algorithms by enumerating terms in Haskell
1–10 of 50 posts
Re: Discovering algorithms by enumerating terms in Haskell
#2I'm confused, what is the search space? All possible functions from Int -> Int? And how do you verify a result is optimal across inputs?
Re: Discovering algorithms by enumerating terms in Haskell
#3I'm confused about what this could be, with a title as technical as this but being posted somewhere with the signal:noise of Twitter, also where I can't view it.
Re: Discovering algorithms by enumerating terms in Haskell
#4Might help to read some of the author's earlier work, like:
https://medium.com/@maiavictor/solving-the-mystery-behind-ab...
And the Omega documentation:
https://hackage.haskell.org/package/control-monad-omega-0.3/...
But I'll admit, I want to see a paper or code.
Re: Discovering algorithms by enumerating terms in Haskell
#5"Perhaps I'm being really naive and an exponential wall is about to humble (and embarrass) me."
There is something fascinating and awe-inspiring about searching very large, enumerative datasets for useful results. Like wandering Borge's Library of Babel in search of not just meaning but something true and useful.
Re: Discovering algorithms by enumerating terms in Haskell
#6I don't think the original submission has enough details for us to reproduce or even understand what's being done. Omega monad is just a diagonal search monad that supports infinity. I don't understand the syntax in the screenshot. What's the type of the terms being enumerated? I can see lambda, but what's @inc or the pluses and minuses?
Re: Discovering algorithms by enumerating terms in Haskell
#7Maybe this could be used with the Evolutionary Algorithm subset known as Genetic Programming, originally popularized by John Koza in the 80s?
Re: Discovering algorithms by enumerating terms in Haskell
#8More on the Omega monad from its author:
http://web.archive.org/web/20210616105135/http://lukepalmer....
Re: Discovering algorithms by enumerating terms in Haskell
#9I'm confused about what this could be, with a title as technical as this but being posted somewhere with the signal:noise of Twitter, also where I can't view it.
For non-twitter, I was looking the other day at https://reasonablypolymorphic.com/blog/syntax-guided-synthes... , which unfortunately points at a dead page related to https://sygus.org/comp/2019/ , but seems related?
Re: Discovering algorithms by enumerating terms in Haskell
#10I'm confused about what this could be, with a title as technical as this but being posted somewhere with the signal:noise of Twitter, also where I can't view it.
For non-twitter, I was looking the other day at https://reasonablypolymorphic.com/blog/syntax-guided-synthes... , which unfortunately points at a dead page related to https://sygus.org/comp/2019/ , but seems related?
I believe the dead link in the article is referencing this journal paper[1], which is an expanded version of the original syntax guided synthesis paper.
[1] https://web.eecs.umich.edu/~weimerw/2022-481W/readings/Alur1...