/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 muratbuffalo.blogspot.com
SOSP19. I4: Incremental Inference of Inductive Invariants for Verification of Distributed Protocols
| | ahelwer.ca
How do you reason about a probabilistic distributed system? -
7.6 parsecs away

Travel
| | In which I am stunted upon by coin flips Wasn't too long ago that I felt pretty good about my knowledge of distributed systems. All someone really needed in order to understand them, I thought, was a thorough understanding of the paxos protocol and a willingness to reshape your brain in the image of TLA?. Maybe add a dash of conflict-free replicated datatypes, just so you know what "eventual consistency" means.
| | buttondown.com
What makes concurrency so hard? Buttondown
7.7 parsecs away

Travel
| | Is it something about human brains, or something about the problem domain?
| | simpleprogrammer.com
Software Developer Skills - The Technical Skills You Need To Have
7.2 parsecs away

Travel
| | What Languages to Learn, How to Structure Code, Algorithms & Data Structures, Methodologies, Source Control, Object Oriented Design, Frameworks or Stack ...
| | ahmedhosssam.github.io
Ahmed Hossam
33.0 parsecs away

Travel
| The lexical analyzer (lexer) takes a stream of characters and produces a stream of names, keywords, and punctuation marks; it discards white space and comments between the tokens. Lexical tokens have types in any programming language, example: ID foo, x, n14 NUM 73, 0, 082 REAL 3.14, 10., 1e9, 0.5 COMMA , NOTEQ != LPAREN ( RPAREN ) Punctuation tokens such as IF, VOID , RETURN constructed from alphabetic characters are called reserved words and, in most languages, cannot be used as identifiers.