We introduce a geometric process algebra based on affine geometry, with the aim of describing the concurrent evolution of geometric structures in 3D space. We prove a relativity th...
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...
This paper discusses Curry’s work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program compositi...
Liesbeth De Mol, Maarten Bullynck, Martin Carl&eac...