« first day (313 days earlier)      last day (333 days later) » 

03:37
I am not sure how much of this inside of topic, but just use bash and not things like fish, because I am worried of breaking things, but how much would I broke If i setup something like gitlab.com/ralt/avesh or shcl.io
04:24
without context that sounds very funny
04:59
@Redz What sounds very funny?
 
1 hour later…
06:28
C#'s volatile seems much more rigorous than C's.
@DannyuNDos What about Java's volatile?
Some knows if there is a Haskell library for docs.kernel.org/usb/usbip_protocol.html?
06:45
Dunno about Java.
53
A: Why are volatile objects so difficult to work with in C++?

Alexis KingWhat volatile actually means The meaning of volatile in C and C++ is often poorly understood. The main use case for volatile is low-level programming on embedded systems that utilize memory-mapped I/O. In these systems, portions of the address space are not mapped to ROM or RAM; instead, reads fr...

Java and C# make arguably poor design & keyword choices in this space
Yeah, I noticed it's more like atomic.
07:33
And what the heck, C# has a fancy name for function pointers, namely "delegates".
07:44
And C# lacks type unions? Dang.
@DannyuNDos Do you mean Sum types?
 
2 hours later…
10:08
@Delfin 'just use bash and not things like fish'
idk or my high school brain is just whacked
@Redz Imissed an 'I'
 
4 hours later…
14:37
@DannyuNDos yeah its literally just atomic
Someone have an idea of if using shcl.io or gitlab.com/ralt/avesh as the shell could break things?
14:53
> as of the time of this writing, the pipe module is no longer working, which is obviously bad.
@DavidYoung ugh eclipse
15:35
@Seggan Yeah. I was thinking the thing I'd work on would be much lighter weight than that.
not in that sense
eclipse itself is far behind modern editors
Ah, I didn't really know that. It's been quite a while since I've used it, hah
I'm also realizing that this project idea doesn't really have enough of a contribution, at least in its current form. The main advantage is that you wouldn't have a discrepancy between the language implementation and the specification that you use to prove properties of the PL in Coq/Agda, but that's not too much on its own
 
1 hour later…
17:07
0
Q: What should be the precedence of the bitwise operators relative to each others?

WhiteMistIn C, the relative precedence of bitwise operators is as follows, from high to low precedence: ~ bitwise NOT << >> bitwise left shift and right shift & bitwise AND ^ bitwise XOR | bitwise OR It makes sense to have ~ have a higher precedence than & which itself have a hi...

 
2 hours later…
19:10
C's operator precedence is full of pitfalls. Rather than assigning precedence to everything, I like the idea of plainly refusing to compile without explicit parentheses, in non-obvious cases.
I'd prefer simple left-to-right precedence for everything except the super obvious ones
19:23
associativity order is another problem, to which requiring explicit parentheses can also be a solution, when not actually associative.
@mousetail like math?
im sorta in the middle: i think everything should have precedence but there should be fewer precedence classes
like lump all the bitwise stuff in one class (except NOT), and/or/equality/comparison should be in another class, etc
 
3 hours later…
22:06
@Seggan Just using GEMA?
22:24
As structured the question seems like LODC, but there are definitely angles it could take that have useful answers
22:42
@Delfin GEMA?
22:55
ah the order of precedence thing
what i meant was that yes, arithmetic should follow that
while everything else should be lumped into a few precedence classes, not the zillion C (and its descendants) has
23:14
@Seggan I think that it would be Groupings Functors Bindings Bitoperators Exponents Multiplication and Addition.
29
A: Haskell operator vs function precedence

mucahoIn addition to the information provided by other answers already, note that different operators can have different precedences over other operators, as well as being left-/right- or non-associative. You can find these properties for the Prelude operators in the Haskell 98 Report fixity section. ...

Haskell is complicated, Mainly because you can always make your own infix operators
because they are defined in the standard library rather than in the language definition
23:36
@Delfin what about equality, and/or, conditionals?
I will suppose you not mean assignment with equality. They would be lower precedence than addition
23:50
@DavidYoung Do you know a reference with all the precedence order of Haskell?

« first day (313 days earlier)      last day (333 days later) »