Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
thedigitalengel
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
16 ms
·
31.
▲
by
thedigitalengel
14y ago
Would you feel secure about using a cryptographic system without a proof?
32.
▲
by
thedigitalengel
14y ago
They're not the same. VMs can assume invariants (which may not always hold) and compile specialized methods which depend on those assumptions and then fall back to a non-optimized version during the execution of a method. To do somethin
33.
▲
[Haskell] Initial Algebras: Part I (F-Algebras)
(playingwithpointers.com)
1 points
by
thedigitalengel
14y ago
|
0 comments
34.
▲
First steps with Agda: provable factoring
(playingwithpointers.com)
1 points
by
thedigitalengel
14y ago
|
0 comments
35.
▲
First steps with Agda: well founded recursion
(playingwithpointers.com)
1 points
by
thedigitalengel
14y ago
|
0 comments
36.
▲
Weird C program performance
(stackoverflow.com)
1 points
by
thedigitalengel
15y ago
|
0 comments
37.
▲
by
thedigitalengel
15y ago
The point is, unless you are using some macro magic in C, you'll almost always have to make such a compromise to get an abstracted out sort function.
38.
▲
Type-safe Tic-tac-toe
(playingwithpointers.com)
4 points
by
thedigitalengel
15y ago
|
0 comments
39.
▲
Recursion in Escher
(escherdroste.math.leidenuniv.nl)
2 points
by
thedigitalengel
15y ago
|
0 comments
40.
▲
λ→ is normalizing
(playingwithpointers.com)
2 points
by
thedigitalengel
15y ago
|
0 comments
41.
▲
by
thedigitalengel
15y ago
This is the best -- I've literally built my software engineering career pivoting off this program.
42.
▲
by
thedigitalengel
15y ago
I think the total budget is of the order of several million dollars.
43.
▲
by
thedigitalengel
15y ago
Right now, the macros are very naive -- they are passed the entire unevaluated AST on which the macro is invoked and the new AST they return is used instead. I think this makes them FEXPRs. They do capture the defining lexical environment
44.
▲
by
thedigitalengel
15y ago
This is really a no-risk, learning project, so I'll probably try to implement System F in some form; eventually. It isn't an assignment and I have no deadlines. But, yes, I agree that starting with some simpler type system (Hindley Milner m
45.
▲
Show HN: small lisp interpreter in Haskell
(github.com)
25 points
by
thedigitalengel
15y ago
|
4 comments
46.
▲
Programming languages as women
(columbia.edu)
1 points
by
thedigitalengel
15y ago
|
0 comments
47.
▲
by
thedigitalengel
15y ago
There is a list here: http://www.haskell.org/haskellwiki/Template_Haskell#Projects I'm a Haskell newbie, and have not done much with TH yet. But I can imagine a bunch of TH code generating a lexer or a parser out of some meta-description
48.
▲
by
thedigitalengel
15y ago
That is very true, I'll definitely use TH only as a last resort. Perhaps it would be cleaner to output a list of tokens, which the compiler then parses. But then that is not much far away from generating a string. :)
49.
▲
by
thedigitalengel
15y ago
This (the second) way of doing things looks much more sensible -- thanks!
50.
▲
Macros in Haskell
(playingwithpointers.com)
50 points
by
thedigitalengel
15y ago
|
11 comments
51.
▲
Tree Traversal in O(1) space.
(playingwithpointers.com)
2 points
by
thedigitalengel
15y ago
|
0 comments
52.
▲
by
thedigitalengel
15y ago
Neither have I. I just find it very beautiful.
53.
▲
Haskell's Fixed Point Combinator
(playingwithpointers.com)
36 points
by
thedigitalengel
15y ago
|
8 comments
54.
▲
by
thedigitalengel
15y ago
Reminds me of Tyler: It's only after you've lost everything that you're free to do anything.
55.
▲
by
thedigitalengel
15y ago
I can't say much about "Dive into Python", since I've not read it.
56.
▲
by
thedigitalengel
15y ago
I've always found SICP quite overrated (I'm saying this after reading it). Given Python's learning curve, a much better curriculum would involve going through the codebase of a few well-chosen projects, sending in a few patches and perhaps
57.
▲
by
thedigitalengel
15y ago
The author did not think carefully about the easy-first-use vs. more-productive-in-the-long-run dichotomy. Usually, you can't have both.
58.
▲
Learning Haskell
(playingwithpointers.com)
3 points
by
thedigitalengel
15y ago
|
0 comments
59.
▲
Tart 0.1
(lists.cs.uiuc.edu)
5 points
by
thedigitalengel
15y ago
|
0 comments
60.
▲
by
thedigitalengel
15y ago
Hackers? Cliched argument; but every time I see such a misuse, I get a little sadder.
More ›