The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is a
well-structured but weak logic since it cannot capture unbounded (infinite) behavior. Instead …

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an
interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of …

Abramsky's Geometry of Interaction interpretation (GoI) is a logical-directed way to reconcile
the process and functional views of computation, and can lead to a dataflow-style semantics …

The linear lambda calculus, where variables are restricted to occur in terms exactly once,
has a very weak expressive power: in particular, all functions terminate in linear time. In this …

Several type systems have been proposed to statically control the time complexity of lambda-
calculus programs and characterize complexity classes such as FPTIME or FEXPTIME. A …

The mechanized verification of mathematical proofs is an application of computational logic
that is of importance in both mathematics and computer science. These applications range …

Multiparty session types (MST) are a well-established type theory that describes the
interactive structure of a fixed number of components from a global point of view and type …

We express in terms of binary trees seen as Gödel System T types (with the empty type as
the only primitive type) arithmetic computations within time and space bounds comparable to …

Scripting languages have renewed the interest in languages with dynamic types. For various
reasons, realistic programs comprise dynamically typed components as well as statically …

Gödel's System T is the simply typed lambda calculus extended with numbers and an
iterator. The higher-order nature of the language gives it enormous expressive power—the …