Tarean

23 ms·

181.
by Tarean 9y ago
Some algorithms require mutation to have a decent time complexity and ST allows you to implement those. There is a tiny cost for each mutable memory location since the garbage collector has to work around then. A single array won't eve
182.
by Tarean 9y ago
Looks really clean. Does bluebird handle this( https://hackage.haskell.org/package/base-4.9.0.0/docs/Contro... ) problem? Sometimes you want to catch two different sorts of exception. You could do somethi
183.
by Tarean 9y ago
Gotta be honest, when I use git without tab completion for extended amounts of times I end up with a 'delete' branch eventually.
184.
by Tarean 9y ago
I usually like to think of delimited continuations from the inside. First a haskell example because there I can heap on syntax sugar: do x <- foo y <- bar (x+1) baz (x*y) let's look at bar: bar x
185.
by Tarean 9y ago
I'd guess that means speech to text and shape writing run at least partially on servers? Not hugely surprising but it seems really bizarre that quiet hours would need it. Probably some integration with cortanas contact database so that
186.
by Tarean 9y ago
Pure languages like haskell might be the closest thing at the moment. In haskell you embed domain specific languages when you require side effects: class MonadState s m where get :: m s put :: s -> m () This is l
187.
by Tarean 9y ago
I think there are different types of space leaks: - Reference is kept alive so that a computation can't be streamed. Easy to figure out with profiling but fixing them might make the code more complex. Also, if you have a giant static l
188.
by Tarean 9y ago
Reflex is a frontend library for haskell. -- create an input text widget with auto clean on return and return an event firing on return -- containing the string before clean inputW :: MonadWidget t m => m (Event t T.Text)
189.
by Tarean 9y ago
I never quite got the finer points but apparently affine types are great if you want to manage sharing in the presence of mutability and linear types are great if you want to guarantee fusion.
190.
by Tarean 9y ago
Kakoune is always super tempting to me but the plugin thing is a deal breaker for me. Not for IDE-like features but because limiting myself to vanilla vim motions feels like using a bad vim plugin by now. At least surround.vim, targets.vim
191.
by Tarean 9y ago
I think the current goal is to let neovim instances to communicate p2p so that they transparently use the same session. Mostly because adding multi-tenancy to vim would be a living hell without adding much over that approach. Has been a wh
192.
by Tarean 9y ago
Most IDE's have fantastic fuzzy search and go-to-identifier tools you might want to try. I find it much easier to stay concentrated on a change when not needing to hunt files with the mouse.
193.
by Tarean 9y ago
Lazy version would be `:vsplit | lcd %:h | term ranger<cr>`. `vsplit` splits the window vertically. `lcd` sets the bufferlocal working directory which is a new feature in neovim. `term ranger` launches the terminal emulator. If you wa
194.
by Tarean 9y ago
I think haskell's syntax is extremely beautiful. However code that uses two dozen operators in half as many lines is incredibly ugly in any language and doing that can be quite tempting in haskell. For code that non-haskellers have to
195.
by Tarean 9y ago
I have been thinking for a while that oop in the message passing sense is basically coroutines. I guess that is encoded in Erlang? Probably should learn it at some point.
196.
by Tarean 10y ago
Though I don't think I would use backtracking for an actual haskell solution. Probably something like: import Data.List (permutations) solve :: Int -> [[Int]] solve i = filter (valid . zip [1..]) (permutations [1..i])
197.
by Tarean 10y ago
We can look at effects as a dsl built upon a monad. The state effect lets us get and put state, for instance. There are two extensible ways to represent this: data State a self = Get self | Put a self class State repr where
198.
by Tarean 10y ago
Isn't the identity monad isomorphic to normal functions? In that sense normal functions are a monad.
199.
by Tarean 10y ago
Pure functional programming means that everything a function does has to be part of the return type. That means you often get functions like a -> Maybe b Instead of throwing an exception or returning null to make the possible fa
200.
by Tarean 10y ago
I think an easier to understand definition uses fmap and join. Example: f x = [x, x*2] f =<< [5, 3, 4] join (fmap f [5, 3, 4]) join ([[5, 10], [3, 6], [4, 8]]) [5, 10, 3, 6, 4, 8] So the pattern is fmap a fun
201.
by Tarean 10y ago
I think it is necessary to go with an erlang like style if one wants to get a remotely acceptable cost model. I am not sure how much static typing actually hinders and how much that is a matter of tooling, though. Maybe static typing could
202.
by Tarean 10y ago
You might be misunderstanding functors since they are basically tangential to classes. Every generic class `F<T>` where we can lift functions `T -> S` to `F<T> -> F<S>` is a functor. Think of lists as example, they a
203.
by Tarean 10y ago
An insight I found quite interesting: oo style is great at extending types. You can add a subtype at a later date without modifying existing code and it just works. Functional style is great at extending behavior. You can take an existing t
204.
by Tarean 10y ago
I have no experience in kotlin but many other languages that use iterators would go with something like for length, bytesRead in input.bytes() { //... Edit: quick google search, the actual syntax is file.forEachBloc
205.
by Tarean 10y ago
The implied bound one reminded me of a very similar thing in haskell https://prime.haskell.org/wiki/NoDatatypeContexts . Basically data Hashable a => Set a = ... is completely useless. It only forces you to
206.
by Tarean 10y ago
I find Scala enormously impressive because it manages to bridge the gap between subtyping. Not sure whether that is worth the complexity this brings, though. Subtyping makes a lot of things that are easy in purely functional languages hard.
207.
by Tarean 10y ago
RosettaCode has these for a lot of problems: http://rosettacode.org/wiki/99_Bottles_of_Beer
208.
by Tarean 10y ago
When trying to come up with hard problems in computer science I would think np hard, not robotics. Building a robot to toss the ball is still hard but that is an engineering and physics problem. The calculations remain simple.
209.
by Tarean 10y ago
I mean, an array could have worked but I think this is more readable than a clever version would have been. main = mapM_ putStrLn $ reverse verses where verses = combine <$> enumeratedSlices songLines comb
210.
by Tarean 10y ago
I think java's problem here is how annoying it is to split these up. For example your example completely split up in java vs haskell: Java IntPredicate even = i -> i % 2 == 0; IntUnaryOperator add2 = i -> i + 2; UnaryOper

More ›