Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
axman6
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
25 ms
·
181.
▲
by
axman6
13y ago
Do you honestly believe what you're saying? Of course they do, companies constantly keep track of the patents their competitors file to a) do as you said and avoid infringement and b) get inspiration for new ideas (There's nothing
182.
▲
by
axman6
13y ago
Firstly, your example is so ridiculous I can't see how it adds anything to the discussion. No, it would never be granted a patent, so what exactly is your point? Secondly, you have accurately described the patent system; > if we
183.
▲
by
axman6
13y ago
I came to the comments for exactly the same reason, they're excellent diagrams!
184.
▲
by
axman6
13y ago
> Make it easier to find prior art How, exactly?
185.
▲
by
axman6
13y ago
No, it's not. Releasing their ideas using a patent involves a lot less risk for a company who relies on an invention of theirs than keeping it secret and just waiting for someone else to have the same idea. It provides stability that t
186.
▲
by
axman6
13y ago
A working implementation is, and never will be, a requirement got the grant of a patent. The figures show an example of one or several implementations of an idea, but have no baring in the defining the scope of the invention. There's n
187.
▲
by
axman6
13y ago
I'd love to see some evidence for your claims, because they're pretty ridiculous. Arithmetic coding is now something that anyone can use because the patent applying to it has reached the end of its term. If IBM had instead decided
188.
▲
by
axman6
13y ago
No, they're not. You may like to believe this, but it's not a fact. Many inventions are quite mundane, but doesn't mean they weren't inventive (ie, non-obvious) at the time. And the other thing that most people seem to f
189.
▲
by
axman6
13y ago
What? Someone on hackernews who actually understands the patent system enough to know what's actually going on? This is unheard of!
190.
▲
by
axman6
13y ago
Why? A patent lacks full disclosure if it doesn't have enough information for a person skilled in the art to reproduce the invention; it must be enabling. Patents are not about specific implementations of an idea, they are about the id
191.
▲
by
axman6
13y ago
do you mean the: foo x | trace (show x) False = undefined | otherwise = ... x ... ? That's not comparing anything to undefined, now is it a pattern guard, it's executing the trace function which then returns Fal
192.
▲
by
axman6
13y ago
> if it compiles, it most likely just works I believe the more you learn, the more this becomes true as well. To begin with, you'll write a lot of code that has potential bugs (like missing cases when pattern matching, using types t
193.
▲
by
axman6
13y ago
I think this is more of an implementation issue than a language issue. A haskell compiler could choose to reevaluate everything every time it's demanded, and it would run in very little space. GHC uses thunks to represent computations
194.
▲
by
axman6
13y ago
No, it's not, but Haskell's type system is what allows quickcheck to work as well as it does. The implementations in other languages mostly lack a lot of the power provided by the type system.
195.
▲
by
axman6
13y ago
How do you get ILP from this? Seems like it would make scheduling much more difficult because you now need to make sure that that the results you need for each instruction are in the order in the belt you need, and you have to be able to ex
196.
▲
by
axman6
13y ago
That works fine until you have things like branches and function calls. Most call conventions specify which registers arguments are in, and with what you're proposing each function call needs to know where it is up to in the rotation a
197.
▲
by
axman6
13y ago
I think that the advantage the mill gives here is more room to compute things speculatively on the critical path. You can happily load from an invalid address and then realise that was wrong later without causing an exception in the CPU; sa
198.
▲
by
axman6
13y ago
Not sure how relevant it is, but isn't PTX available through LLVM?
199.
▲
by
axman6
13y ago
Sure it does, you just need Quickcheck property based testing: forall $ \xs -> sorted (qsort xs :: [Int])
200.
▲
by
axman6
13y ago
It involves PHP so...
201.
▲
by
axman6
13y ago
Sounds like you've basically explained several of the common concurrency features of Haskell. Haskell has the advantage that any pure data structure (ie, not using mutable references, which is almost all data structures we use) can be
202.
▲
by
axman6
13y ago
That's an implementation detail and should be open to change without breaking things.
203.
▲
by
axman6
13y ago
To start with, Functor gives an generic interface (fmap) allowing you to take Foo<A> and a function B f(A) and apply it to get Foo<B> Then monad gives us something called join, which lets us take:
204.
▲
by
axman6
13y ago
Ada too, it has distinct procedures and functions; the latter producing only one output based only on its inputs (though I believe recently they added the ability to also have out parameters so multiple values can be returned).
205.
▲
by
axman6
13y ago
If it's enough for a person skilled in the art to produce the invention without needing any inventive thought, then yes, it is.
206.
▲
by
axman6
13y ago
Their FAQ seems to suggest it's more than RSVP, the addition of the red 'centre' and the differing alignment (not centred on the middle of the word but slightly to the left). I've used both and I found Spritz more comfor
207.
▲
by
axman6
13y ago
This Spritz thing seems to do that, which I found very comfortable.
208.
▲
by
axman6
13y ago
Congratulations on being one of the millions of internet users who have no idea how the patent system works. First to file is purely for determining priority of an application; the date at which the patent office (or another patent office u
209.
▲
by
axman6
13y ago
I'll keep this disclosure in mind when it comes across my desk. But now you've got no chance of patenting it yourself, so touch luck =).
210.
▲
by
axman6
13y ago
I'm quite confused, you read a joke, which apparently you didn't like, on an unofficial (albeit heavily OpenBSD focused) blog, and that's a reason not to use OpenBSD? Isn't this almost the definition of an ad hominem arg
More ›