maxiepoo

11 ms·

61.
by maxiepoo 9y ago
I believe this is a design decision, because relying on some enormous implicit repl state and updating the code in place is a good way to get yourself into states that are impossible to reach in an actual running program. Racket is a functi
62.
by maxiepoo 9y ago
Seems like you could easily make a library that just parses into some Union type that represents JSON values. It's likely a design decision to force people that otherwise wouldn't to represent their data in a more structured way.
63.
by maxiepoo 9y ago
Can you not do the same thing as JSON.parse() in Elm by parsing into an unstructured JSON type?
64.
by maxiepoo 9y ago
Lisp is certainly amenable to this, and structured editors for lisp have been around for a long time, but the concept is not specific to lisp except inasmuch as it's much easier to implement since the syntax is so similar to the AST. F
65.
by maxiepoo 9y ago
Just a note, this post has nothing to do with Haskell.
66.
by maxiepoo 10y ago
Not the OP, but the cool thing about HoTT to a user of proof assistants is that it makes working with "quotients" easier. I put quotients in parentheses because really HoTT is about generalizing the idea of a quotient type. Quotie
67.
by maxiepoo 10y ago
What do you mean by AC is provably false in intuitionistic logic? Intuitionistic logic + AC has as models ordinary models of classical logic since intuitionistic logic is a refinement of classical logic. Do you mean [Diaconescu's theor
68.
by maxiepoo 10y ago
Do you have experience teaching both or are you just speculating?
69.
by maxiepoo 10y ago
CompCert took painstaking work by many world experts, it was certainly not some heroic one-man effort by Xavier.
70.
by maxiepoo 10y ago
I disagree with the front page of this site, the "crowning achievements of mathematics" are not "her theorems", but our definitions.
71.
by maxiepoo 10y ago
If by "Monad situation" you mean trying to learn a concept by just reading a single blog post then sure. Trying to learn something by scattered blog posts without engaging in material is a bad idea no matter what the problem is. F
72.
by maxiepoo 10y ago
The use of the term "witness" here comes from constructive logic, where proofs of propositions have actual computational content. There "witness" means the same thing as "proof" but is more evocative that the p
73.
by maxiepoo 10y ago
Yes, I experienced serious deja vu from this article.
74.
by maxiepoo 11y ago
I expected that code to print "hello everyone!" forever but apparently the top level acts as a delimiter. This is why I think delimited continuations make more sense since even call/cc is already "delimited" but wit
75.
by maxiepoo 11y ago
The precise technical innovations of HoTT are just that, technical. I'll try to focus on a practical consequence of those innovations. If you know anything about data structures you know that a lot of times, 2 different instances of th
76.
by maxiepoo 11y ago
Sorry to be pedantic, but in what way is 'On Lisp' a primary source? Especially compared to a Smalltalk manual.
77.
by maxiepoo 12y ago
Yep, I wrote that as my first project in rust and it was used for a lot of the Piston project repos. Unfortunately I stopped updating that in December because breaking changes were happening too frequently for me to keep up. I'll proba
78.
by maxiepoo 12y ago
I went straight to the fridge and found I hurt my hand before I cracked the egg. I was as surprised as you are.
79.
by maxiepoo 12y ago
I just don't get Erik Meijer, though I think he's quite entertaining. He seems to enjoy taking the other side wherever he is. Here's a talk I was at a couple years ago where he makes fun of the ideas he's presenting in t
80.
by maxiepoo 12y ago
Yes and in Go (and hopefully all curly-brace languages of the future) this is actually a syntax error, you need the braces: if (a < b) { a = b; }
81.
by maxiepoo 13y ago
I was disappointed in how little detail this went into on the different pointer types and how/when to use each one. IIRC, it doesn't even mention lifetimes, which are the feature that's currently stopping me from writing any
82.
by maxiepoo 13y ago
Like paredit: http://www.emacswiki.org/emacs/ParEdit ?
83.
by maxiepoo 13y ago
What do you do with higher-order functions (which PHP has I believe)? If I write a typed map : (a -> b) -> [a] -> [b] and then it's called with an untyped function as input, but it returns a something that's not a b. Do y
84.
by maxiepoo 13y ago
Oh I see, so there's no change in code generation for typed code, then?
85.
by maxiepoo 13y ago
Hi Bryan, How do you protect from type errors when a value crosses from the untyped to typed fragment? Do you use contracts?
86.
by maxiepoo 13y ago
The problem with Prolog is that to get reasonably performant code at all you have to understand the underlying unification algorithm and manipulate it using cuts to limit backtracking. This means that you have to break the core abstractions
87.
by maxiepoo 13y ago
Interesting, do you have a link to any of those David Simon comments? I always thought that the themes of "The Wire" were so coherently presented that they would be impossible to overlook.
88.
by maxiepoo 13y ago
Random property-based testing is useful for that sort of thing, as used in the QuickCheck library (most popular in Haskell/Erlang but there are ports to pretty much every language in existence). One property you could use for your exam
89.
by maxiepoo 13y ago
Abelian group is a sort of stringent requirement, they probably just mean a plain monoid? After all it works for python lists, which form a non-commutative monoid: [] + [] == [] [1,2] + [3] != [3] + [1,2]
90.
by maxiepoo 13y ago
I was very curious to see a post on the Ynot project http://ynot.cs.harvard.edu/ on HN but this make more sense.

More ›