### informal methods applied to networks and timeouts

Distributed computation involves many interesting issues concerning shared data. Here I want to sketch out what networks look like using applied (informal) mathematics so we [...]

Distributed computation involves many interesting issues concerning shared data. Here I want to sketch out what networks look like using applied (informal) mathematics so we [...]

Mostly for my own amusement, I wanted to see if it was possible to specify basic sorting algorithms in ordinary algebra without ”formal methods” or either pseudo [...]

Types as sets and subtypes as subsets. This may be due to confusing usage in mathematical practice where, for example, we often see references to integers as a subset of [...]

The Google manifesto is primarily a conservative political rant, not a scientific argument. Damore claims that any program to encourage hiring and promotion of women and [...]

Principal type-schemes for functional programs∗ Luis Damas† and Robin Milner First published in POPL ’82: Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on [...]

Consider the following code: void f(void) { unsigned char x[1]; /* intentionally uninitialized */ x[0] ^= x[0]; printf("%d\n", x[0]); printf("%d\n", x[0]); return; } In this [...]

It’s odd that all the descriptions of basic programming operations, such as sorting, rely on pseudo code or complex formal logic. All we are doing is modifying finite [...]

Google Scholar tells me that “Why Functional Programming Matters” was published in 1989 and has been cited over 1000 times. Here’s a quote. Recall that a [...]

(minor wording correction and more complaining added 10/2/2016, minor edits 10/5/2016) Multi-proposer Paxos is a very clever and notoriously slippery algorithm for obtaining [...]

The Chang-Maxemchuk algorithm (US Patent 4,725,834 ) solves atomic broadcast (and in-order broadcast) problems for distributed networks in a far simpler and more efficient [...]

Copyright © 2018 | MH Corporate basic by MH Themes