pschanely

5 ms·

1.
by pschanely 2y ago
> I believe your argument on the performance penalty is right, and as a corollary, this implies that contracts are mostly useful if associated with a formal proof system. Contracts in production are probably a bad idea, in most cases. Ag
2.
by pschanely 4y ago
A little encouragement goes such a long way. Thank you for trying it out, and especially for coming back here to let me know how it went!
3.
by pschanely 4y ago
Oh, thank you! I don't have any plans for expanding to other music services. But skimming the Apple Music API, I think it's possible. Particularly if you think you'd use it, I'll investigate a bit more and let you know.
4.
by pschanely 4y ago
Music Tonight: https://musictonightapp.com/ Makes a Spotify playlist of artists playing near you, tonight. No revenue. I really just made it for me; make the playlist in the am, listen during the day, and maybe see somethin
5.
Show HN: Hypothesis and CrossHair demo (concolic / SMT-based PBT)(pschanely.github.io)
3 points by pschanely 5y ago|0 comments
6.
Code Contracts Propagate Requirements(pschanely.github.io)
1 points by pschanely 5y ago|0 comments
7.
by pschanely 6y ago
Great! Sadly, I don't see anything on linkedin though. Feel free to just ping me by email: pschanely@gmail.com
8.
by pschanely 6y ago
Sadly, mine largely aren't committed to words yet. I do have a small thing on implementing regular expressions: https://medium.com/@pschanely/modeling-python-regular-expres... But there is so much to talk about: g
9.
by pschanely 6y ago
Looking at some of your SMT-based projects, I'd love to compare your SMT solver notes with my mine from working on https://github.com/pschanely/CrossHair Sadly, there aren't a lot of resources on how to use S
10.
Show HN: (Failing to) model Python regular expressions with Z3(medium.com)
2 points by pschanely 6y ago|0 comments
11.
by pschanely 7y ago
Totally agree that this is confusing. I've stolen and committed your suggestion. Thank you both!
12.
by pschanely 7y ago
Yes. Z3 is impressive. I intend to do a write-up of how I chose to model Python values in it soon.
13.
by pschanely 7y ago
That's right! We pick different choose execution paths arbitrarily and accumulate constraints in an SMT solver as we go. It's implemented with special objects that look just like ints, strings, etc; this might help: https:/&
14.
by pschanely 7y ago
That would be amazing. It's easy to turn CrossHair into an absurdly slow fuzz tester (imagine hashing or printing your inputs early in the process). I think the ideal product would be good at both symbolic and concrete tactics, and the
15.
by pschanely 7y ago
Hi all! My primary objective with this post is to find potential collaborators and people willing to try it. (and file bugs!) If you do try it, I'd encourage you to think of it as an exercise in formally documenting your code's be
16.
Show HN: CrossHair – SMT Assisted Testing for Python(github.com)
97 points by pschanely 7y ago|14 comments
17.
Show HN: A turn-based strategy game with emoji graphics(medium.com)
4 points by pschanely 7y ago|0 comments
18.
by pschanely 9y ago
The README.md goes fast, but I have some feel for what's going on. Could I, for instance, connect a client and start logging every message in the system using a liberal matcher and a low weight? Also, it's not obvious to me how th
19.
by pschanely 10y ago
I'm glad that other folks think this is important too. Stay tuned on twitter/medium. That python library also supports a viewabledict (for key-value mappings). I've got an experimental compiler which starts with an AST (store
20.
Show HN: Incremental MapReduce and the Model-View Problem(medium.com)
10 points by pschanely 10y ago|3 comments
21.
by pschanely 10y ago
Referenced in the paper panic suggested below ( https://news.ycombinator.com/item?id=11595273 ), and suggested to me directly by @mattcmd on twitter ( https://twitter.com/mattmcd/status/72634265284
22.
by pschanely 10y ago
Yes! I think perhaps that f needs only to be a homomorphism instead of an isomorphism, but I don't trust myself enough to make such a claim definitively :) Always curious to follow people doing compiler work; loop me in, yeah? And, ju
23.
by pschanely 10y ago
Unfortunately, I took barely enough grad school classes to be dangerous! It's worth clarifying that the lifting of f through r can change r (to, say r'), in which case, yes, f is a homomorphism from an algebra with r' to an
24.
by pschanely 10y ago
Thank you. And, heck yes, more people need to be talking about how to deal with computations that are largely repeated. That problem comes up all over the place. Couchdb had an interesting approach for this that did not require inverses:
25.
by pschanely 10y ago
Great observations. For the purposes of this exploration, I am entirely assuming arbitrary precision integers (and the math geek in me is really enjoying your use of the adjective "junk", above). Bigger picture, I want to rewrite
26.
by pschanely 10y ago
Totally; great point. My code is here: https://github.com/pschanely/wf-optimizer/blob/master/demo.m... Maude is a programming language based on rewriting: http://maude.cs.illinois.edu/w&
27.
by pschanely 10y ago
Thanks! I have a link to code written in Maude at the very bottom; The code needs so much explanation though. Perhaps I'll highlight the code link at the top of the article?
28.
by pschanely 10y ago
Ah, I knew that HN would tell me what I should be reading! I've only been able to spend a few minutes reading this one, but it looks to me like the first focus there is on eliminating intermediate containing structures, with some inte
29.
Show HN: Optimizing Higher Order Functions with Hypothetical Inverses(medium.com)
55 points by pschanely 10y ago|35 comments
30.
Sorts and Filters Suck(medium.com)
1 points by pschanely 10y ago|0 comments

More ›