Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Let M be a monoidal category endowed with a distinguished class of weak equivalences and with appropriately compatible classifying bundles for monoids and comonoids. We define and study homotopy-invariant notions of normality for maps of monoids and of con ...
The goal of this work is to study Alexander-Whitney coalgebras (first defined in [HPST06]) from a topological point of view. An Alexander-Whitney coalgebra is a coassociative chain coalgebra over Z with an extra algebraic structure : the comultiplication m ...
Developing modern software applications typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that ...
The synthesis and characterization of a series of cobalt(III) complexes of the general type Co(N2O2)(L-2) are described. The N2O2 Schiff base ligands used are Me-salpn (H2Me-salpn = N,N'-bis(methylsalicylidene)-1,3-propylenediamine) (1-3) and Me-salbn ...
We establish model category structures on algebras and modules over operads in symmetric spectra and study when a morphism of operads induces a Quillen equivalence between corresponding categories of algebras (resp. modules) over operads. ...
Developing modern software typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes ...
Developing modern software applications typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that ...
We show that topological Quillen homology of algebras and modules over operads in symmetric spectra can be calculated by realizations of simplicial bar constructions. Working with several model category structures, we give a homotopical proof after showing ...
We propose a new type-theoretic foundation of Scala and languages like it: the Dependent Object Types (DOT) calculus. DOT models Scala’s path-dependent types, abstract type members and its mixture of nominal and structural typing through the use of refineme ...
We present a minimal core calculus that captures interesting constructs of the Scala programming language: nested classes, abstract types, mixin composition, and path dependent types. We show that the problems of type assignment and subtyping in this calcu ...
