10.6k citations
- Centre National de la Recherche ScientifiqueFR4k papers
- Université Paris CitéFR2.5k papers
- Sorbonne UniversitéFR2.1k papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR1.7k papers
- Université Paris-SaclayFR1.5k papers
- Université Paris Sciences et LettresFR1.5k papers
- Université Paris DiderotFR1.3k papers
- Délégation Paris 7FR1.2k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.2k papers
- Observatoire de ParisFR1.1k papers
- CEA Paris-SaclayFR1k papers
- Laboratoire AstroParticule et CosmologieFR909 papers
9 papers · 1 filter
A Type System for the Vectorial Aspect of the Linear-Algebraic Lambda-Calculus
Pablo Arrighi, Alejandro Díaz-Caro, Benoît Valiron
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to…
Holographic quantum criticality and strange metal transport
Bom Soo Kim, Elias Kiritsis, Christos Panagopoulos
A holographic model of a quantum critical theory at a finite but low temperature, and finite density is studied. The model exhibits non-relativistic z=2 Schrödinger symmetry and is…
Validating XML Documents in the Streaming Model with External Memory
Christian Konrad, Frederic Magniez
We study the problem of validating XML documents of size against general DTDs in the context of streaming algorithms. The starting point of this work is a well-known space lowe…
Linearity in the non-deterministic call-by-value setting
Alejandro Díaz-Caro, Barbara Petit
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fi…
Minimization of Automata
Jean Berstel, Luc Boasson, Olivier Carton +1
This chapter is concerned with the design and analysis of algorithms for minimizing finite automata. Getting a minimal automaton is a fundamental issue in the use and implementatio…
Transport of finiteness structures and applications
Christine Tasson, Lionel Vaux
We describe a general construction of finiteness spaces which subsumes the interpretations of all positive connectors of linear logic. We then show how to apply this construction t…