Explore projects

Implements the long awaited client-side of datadec: given datadec types like "expr = num(int n) or ...", let us write:

%when expr e is num(n) { return n; }

An attempt to graft some form of C++-style namespaces into C ("C with namespaces: aka C+N") via another simple-minded pre-processor/translator that could be built in a matter of hours.

This project contains a daemon (command-listener) which runs a specific hard wired command with additional arguments passed to it from a client passing the stdout of that command back to the client, and a suitable command-client to send it.

This project contains a daemon (command-listener) which runs a specific hard wired command with additional arguments passed to it from a client passing the stdout of that command back to the client, and a suitable command-client to send it.

Tests of ElasticSearch to find Anagrams. Change just the IP address embedded in $elastic in Defns.pm

Written in C, this is a tiny compiler for a miniscule Haskell subset (essentially, Int -> Int functions) to Dafny translator. So many C tools (Yacc, Lex, my datadec, generic modules etc) used, only about 20% of the code is human-written.

This is a fork of the kstart provided by Russ Allbery at http://www.eyrie.org/~eagle/software/kstart/ with minor tweaks to enable the static compilation for HTCondor using condor_compile and the static Heimdal Kerberos 5 libs.

A cutdown version of part2 of my mailing list flattening C example, a specialised form of the general "computing transitive closures of a directed graph" method

In LinkedIn's Plain Old C Programming group in , John Coloccia asked about whether "namespaces" would be a good idea for C. He explained that he meant some form of modularity, and I thought I've have a play - this is the result! A module generator!

On the tradeoffs between explainability and robustness in deep neural networks

Provided files for the 1920 Pintos lab exercise

Pancake numbers are an obscure number theory sequence, defined as:

pancake(n) = smallest number of "pancake stack flips" to get the worst case stack-of-n-pancakes sorted. p(1)=0; p(2)=1 [casse ba], p(3)=3]; p(18) unknown

Provided files for the 1920 Pintos lab exercise

Provided files for the 1920 Pintos lab exercise