• 6 Posts
  • 161 Comments
Joined 3 years ago
cake
Cake day: February 1st, 2023

help-circle

  • edinbruh@feddit.ittoProgrammer Humor@programming.devtype theory meme
    link
    fedilink
    English
    arrow-up
    1
    ·
    edit-2
    11 days ago

    Yeah, I also only learned natural deduction, until I got to the languages course and the professor told us “this is similar to natural deduction, but different”.

    Personally I don’t like lean, I prefer coq. But that’s mostly the vibes, both are actually fine. Lean doesn’t do constructive logic, it does classic logic, but you have to give up program extraction for that. That’s why mathematicians are head over heels for lean.



  • Not at all. I would not expect any riir project to reimplement the entire stack in rust. This is not calling a random C dependency. This is literally calling the OS’s API. Literally there’s just this and the kernel.

    As you said its goal is to rewrite a C codebase. The C codebase is coreutils. The correct way to getuser is to use the OS’s API, which happens to be inside libc.so, which has nothing to do with coreutils, it’s an entirely different codebase. End of the story. The OS’s API needs to be exposed as a c library, because c is the only language that can be imported from any other language. If you were to rewrite it in rust, it would use extern 'C' and it could not be any other way. And uutils would still import it from libc.

    Maybe one day we’ll see a rust rewrite of libc (tho it doesn’t make much sense), but this has nothing to do with uutils.

    If you are asking for a rust wrapper around the correct way to getuser, you have literally posted it. You can find it in uutils.

    Also, being compliant is just being compliant. I wouldn’t expect it to be called something like POSIX.rs unless it were implementing every part of POSIX. Which is clearly not what we have here. Or are you suggesting that bash should be called POSIX.c, because it’s in c and it’s POSIX compliant?


  • Well, if you want to be pedantic, I’ll entertain you a bit more.

    You see, C and Unix were “born” together. So sometimes, POSIX intertwines them in weird ways. In this case, getlogin is declared in unistd.h because it’s part of the Unix standard API, however the POSIX standard states that it must be implemented in libc. So the POSIX compliant way to getlogin is to call into libc, which doesn’t need to be glibc, you could use musl and avoid the GNU dependencies. If rust’s stdlib were to offer a getlogin function, the proper approach would be to still call libc. It’s like if on windows you were to call into Win32 to getuser, except on *nix it’s the same file as libc.

    If you want to replace the getlogin implementation, the POSIX compliant place to do it is not in coreutils but in libc, like the aforementioned musl library does.

    So the key here is that getlogin is not art of the c system API. It is actually part of the POSIX APIs, it is just “located” inside of libc, which by the way, does not need to be GNU if you are concerned with uutils’ philosophy.




  • I highly doubt that the birthrate in Italy is 1.14

    The government and the media doesn’t stop yapping about how it’s declining and we are going extinct.

    This happens of course for economical reasons, and the government comes up with the most half assed “solutions” to ever cross human mind. Like “reduce VAT taxes on diapers and powder milk” like that is gonna make any difference.


  • edinbruh@feddit.ittoProgrammer Humor@programming.devtype theory meme
    link
    fedilink
    English
    arrow-up
    2
    ·
    edit-2
    20 days ago

    I’ll give you a fast-forward of the subjects you need to study to actually learn this stuff (with links). Many of these are part of typical computer science curriculums. However, most will exclude at least some of this to its fullest. Note that it’s a lot of knowledge, you might find it frustrating to just deep dive into it on your own, don’t take it the wrong way, maybe follow an actual course and you will be guided into all of this. Maybe I’ll also try to give a run-down, skipping the preupedeitic knowledge… later… if I have time.

    P.s.: to get the general feeling you don’t really need to know all of this tho. Just skim it. And dive deeper if you like it.

    • Any respectable computer scientist needs to know at least some first order logic https://en.wikipedia.org/wiki/First-order_logic
      • Read the semantics part. You don’t need everything, but you must understand what it means for a Formula to be a logic consequence of a set of formulas
      • Read a bit the deductive systems part. I find “natural deduction” (in detail here https://en.wikipedia.org/wiki/Natural_deduction) easier to understand (more… Natural) however, your mileage may vary, many people find it confusing, hence why “sequent calculus” was invented. We’ll use the sequent calculus later
    • You need to know lambda calculus https://en.wikipedia.org/wiki/Lambda_calculus If you know any functional programming language it will be easier, but it’s optional
      • You can learn it on its own, but it fits better as part of a “foundations of computer science” course. I don’t have a link for that.
    • You also need to know a bit of programming in basically any strongly-typed language. This will give you some kind of general idea of what types and type systems are.
    • Now you can put together what you know of types and sequent calculus, and learn what type derivation rule are https://en.wikipedia.org/wiki/Typing_rule
      • Now you understand the meme
      • You can also check out what type systems are as a whole https://en.wikipedia.org/wiki/Type_system
      • We have skipped Curry-Howard, but you can see how typing rules look a lot like logic deduction rules, in particular sequent calculus
    • Hooray, time for Curry-Howard https://en.wikipedia.org/wiki/Curry–Howard_correspondence they basically notice the same similarity you just noted, but take it a step further, they can do it because they know other logics other than first order logic
    • The next step, if you are interested, are theorem provers, which are the direct application of the correspondence https://en.wikipedia.org/wiki/Proof_assistant
      • Check out rocq or agda


  • Oooooohhh! That’s my field of study!

    So, you know how in programming you have data types (like int, float, structs etc…) well, they are actually math.

    In math, more specifically in logics, there’s these things called “judgement derivation systems”. They are basically sets of rules that tells you if you can derive a judgement, from a set of hypothetical judgement. The most notorious are sequent calculus and natural deduction. Both are used to determine if a logic formula is consequence of a set of hypothesis.

    You see, one day Mr Howard wrote to Mr Curry: “I was working on a type system for lambda calculus, and I noticed it kinda look like natural deduction” and curry answered: “wow, that’s cool, I’ll tell you more, a type system for this other thing kinda looks like combinatory logics” and then they both went “could it be that every type system is actually a logic deduction system, and every logic deduction system is actually a type system?” And this is what modern type theory (and theorem provers) are based on.

    Now, formal type systems are often defined as judgement systems. More specifically, they look like sequent calculus, and they use a “context” object, which is often identified with the letter gamma.






  • Italy. Because you need a license to be a taxi driver, and a random company cannot hand them out (and the taxi drivers union is powerful and corrupt). And because the government gotta know who is renting a room where, you can’t just go wherever you want without anyone knowing, especially foreigners. Whenever you rent a room in Italy, the owner will take a picture of your ID/passport, and send your data to the local government. Also you gotta pay taxes on the rooms you rent.