We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
We give the precise correspondence between polarized linear logic and polarized classical logic. The properties of focalization and reversion of linear proofs are at the heart of ...
Olivier Laurent, Myriam Quatrini, Lorenzo Tortora ...
Legacy applications can be difficult and time-consuming to understand and update due to the lack of modern abstraction mechanisms in legacy languages, as well as the gradual dete...
First order reasoning about hyperintegers can prove things about sets of integers. In the author's paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic L...
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...