jpcooper

29 ms·

91.
by jpcooper 6y ago
I need to find more of those.
92.
by jpcooper 6y ago
Haskell allows you to build a (lazy) linked list of characters sourced in blocks from strict ByteStrings, which are pointers to bytes with an offset and length. Leaving out the garbage collection of the cons cells (I would hope that the con
93.
by jpcooper 6y ago
Thanks for posting. I can't find it now, but we mention somewhere in the paper that typing makes it more difficult to fake messages. Typing allows you to make stronger proofs over the properties and behaviour of actor systems. Sorry if
94.
by jpcooper 6y ago
After years of using statically type checked languages like Haskell, I’ve observed that I am quite lazy. If I went to a language without static type checking today, I wouldn’t trust myself to provide the right function arguments in the righ
95.
by jpcooper 6y ago
Lots of implementations here: https://rosettacode.org/wiki/Binary_search . The J implementations are beautiful.
96.
by jpcooper 6y ago
Without trying to sound too flamebaity, as typed versus untyped has been discussed endlessly, I would like to see a study which compares development time and reliability between a Erlang and another typed language running on BEAM. That is,
97.
by jpcooper 6y ago
The author says that he sees no need to include types in the language. There have been efforts to create typed languages which run on the Erlang BEAM virtual machine. I would be interested to know more about why the author thought that type
98.
by jpcooper 6y ago
Thanks for the explanation. This makes sense. In Haskell, strict ByteStrings are a pointer, plus an offset, plus a length. You can call the unpack function on them, which provides a lazy list (it reads from the pointer in blocks) of the cha
99.
by jpcooper 6y ago
Can you explain a bit more how exactly this string representation works, and how it differs from how strings are represented in Haskell? Also, what are you applying Prolog to these days?
100.
by jpcooper 6y ago
Thanks for posting. The Pareto principle (distribution of influence) and Benford’s law (distribution of leading digits) immediately came to mind, which are also very interesting and are linked to in the article.
101.
by jpcooper 6y ago
You might be right. Also if Betfair has its own bots playing as another commenter claims, then it will be hard to compete on odds. Only one way to find out.
102.
by jpcooper 6y ago
I wonder what you base your sentiment on. I can't imagine there's much juice left in Twitter sentiment analysis.
103.
by jpcooper 6y ago
What do you base your political bets on?
104.
by jpcooper 6y ago
Thanks for the tips. The loans idea sounds interesting. I will send you an email.
105.
by jpcooper 6y ago
Thanks for the heads up. It's good to get confirmation that that actually happens. I'd be surprised if it didn't. I'm not too far from implementing my final idea to get profitable bets in. If that (probably as you say) f
106.
by jpcooper 6y ago
Thanks. I would like to point out again that the code is out of date, and the margins displayed there are miscalculated due to not accounting for commission. The general spirit remains. Did you backtest and show potential returns? Can you l
107.
by jpcooper 6y ago
I am assuming that all computer players of this game have access to the algorithm which I have discovered. I am assuming that all computer players have figured out the simple formula which gives them the cheapest profitable odds to back or
108.
by jpcooper 6y ago
Yes. They provide various APIs for this.
109.
by jpcooper 6y ago
Consider the case of betting with a traditional bookmaker. The bookmaker lays (bets against) an outcome. You back (bet for) the outcome. Each party is betting against the other.
110.
by jpcooper 6y ago
Someone has to provide a market. That person has to do it profitably. I am assuming that this is possible, otherwise it would not be possible to play the game. My reasoning could of course be off. Could you elaborate?
111.
by jpcooper 6y ago
On Betfair the house is you. You determine the odds. Let's assume that cards are dealt randomly. If I know the exact probabilities of every outcome I bet on, and I always bet with odds which have a margin over those probabilities, then
112.
by jpcooper 6y ago
For those interested in games of chance, I've been playing around with Betfair's Exchange Hi Lo card game [1]. I came up with an algorithm to, given a game state, quickly compute the odds of all subsequent outcomes in polynomial t
113.
by jpcooper 6y ago
shake is a Haskell Make-like build system. I found it useful for benchmarking C code over lots of different combinations of compilers and compiler options. The initial Make solution I came up with was unwieldy and bug-prone. It was very eas
114.
by jpcooper 6y ago
Linked lists are generally implemented using pointers to other linked list nodes which reside in memory not necessarily adjacent to the original node. If the nodes are in adjacent memory, then you still have the indirection of using pointer
115.
by jpcooper 6y ago
Might be worth checking https://www.geeksforgeeks.org/program-for-nth-fibonacci-numb... .
116.
by jpcooper 6y ago
Yes. My in-order tree traversal example corresponded to how I would implement it in a C-like language. As long as the person setting the question can confirm that the maximum depth is well below the stack size, it stays recursive, though. B
117.
by jpcooper 6y ago
YouTube comments.
118.
by jpcooper 6y ago
"Defunctionalising" makes sense for performance. Ability to debug is a pro. I wanted to point out the similarity between these separate methods. In any case though, I would hope that an optimising compiler would not push onto the
119.
by jpcooper 6y ago
I don't agree with the "constant-stack algorithm" comment. Whether you represent the stack implicitly through recursive function calls, explicitly through building up lambdas, or again even more explicitly by using a singly l
120.
ReasonML: Polymorphic Variant Types(2ality.com)
3 points by jpcooper 6y ago|0 comments

More ›