I am working at the School of Computing
at the University of Kent.
My work focuses on programming language implementation techniques,
complex concurrent systems, and tooling.
Much of work revolves around making interpreters faster, detecting and preventing concurrency bugs at run time, and use modern language runtime systems to provide programmers with better tooling.
For contact details see my page at the School of Computing.
Ü = Übertrag; S = Summe
Ü = a and b
S = a xor b
| a | 0 | 0 | 1 | 1 | 110 |
| b | +0 | +1 | +0 | +1 | +011 |
| 00 | 01 | 01 | 10 | 1001 | |
| ÜS | ÜS | ÜS | ÜS |
| a | b | a and b | a xor b |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 0 |
nand: not (a and b) = not a or not b
nor: not (a or b) = not a and not b