The metatheory of Scala's core type system—the Dependent Object Types (DOT) calculus—
is hard to extend, like the metatheory of other type systems combining subtyping and …

CI Lewis invented modern modal logic as a theory of “strict implication”⥽. Over the classical
propositional calculus one can as well work with the unary box connective. Intuitionistically …

Nakano's later modality allows types to express that the output of a function does not
immediately depend on its input, and thus that computing its fixpoint is safe. This idea …

We define a novel calculus that combines a call-by-name functional core with session-based
communication primitives. We develop a typing discipline that guarantees both …

Functional reactive programming (FRP) merges the immutable principles of functional
programming with the handling of data streams from reactive programs while avoiding …

The Scala language has an expressive type system that supports, among other features, first-
class recursive modules, path dependent types, impredicative type members, and subtyping …

Complexity analysis of stream programs Page 1 Complexity analysis of stream programs Setting
Lab: LORIA, Nancy, France Team: Mocqua https://mocqua.loria.fr/ Team Leader: Emmanuel …

We define a novel calculus that combines a call-by-name functional core with session-based
communication primitives. We develop a typing discipline that guarantees both …