I hereby claim:
- I am obscurecolin on github.
- I am obscurecolin (https://keybase.io/obscurecolin) on keybase.
- I have a public key ASCH8DHWw9k517fLnc2nmQqCnL6OOsjhnEzzRpBcsFD9_go
To claim this, I am signing this object:
(** | |
Iterative version of algorithm presented in | |
the "Tilting at Windmills in Coq" paper; | |
https://xavierleroy.org/publi/parallel-move.pdf | |
The algorithm is effectively a post-order traversal of the transfer relation, | |
accounting for cyclic dependencies along the way. | |
Suppose the transfer relation had no cycles, for example: X -> Y -> Z; |
import java.util.HashMap; | |
import java.util.Map; | |
public class Dominance { | |
/** | |
* Compute immediate dominator tree. | |
* This algorithm is taken from Cooper et al.'s paper "A Simple, Fast Dominance Algorithm": | |
* https://www.cs.rice.edu/~keith/EMBED/dom.pdf | |
* |
// recursive sum function encoded as a dynamically-calling trampoline of continuations returned as thunks | |
// don't compile with -pedantic, there's lots of bad casts going on in this code | |
// this program computes the sum of integers 1 to 50,000 (using a lot of heap memory to do so) | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <stdint.h> | |
#include <talloc.h> | |
#include <dyncall.h> | |
// global talloc allocation context |
I hereby claim:
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
(use-modules (ice-9 rdelim) (ice-9 format)) | |
(define ip "192.168.1.122") | |
(define port 730) | |
(let ((sock (socket AF_INET SOCK_STREAM 0))) | |
(connect sock AF_INET (inet-pton AF_INET ip) port) | |
(read-line sock) ; consume initial response | |
(display "NOTIFY reconnectport=13377 reverse\n" sock) ; there is no reconnect | |
(do ((line (read-line sock) (read-line sock))) |