The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
Van der Sandt's algorithm for handling presupposition is based on a "presupposition as anaphora" paradigm and is expressed in the realm of Kamp's DRT. In recen...
Structural realism is sometimes said to undermine the theory underdetermination (TUD) argument against realism, since, in usual TUD scenarios, the supposed underdetermination conc...
Parallel programs are difficult to write, test, and debug. This thesis explores how programmers build mental models about parallel programs, and demonstrates, through user evaluat...
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...