• 
  Michele Pagani, Paolo Tranquilli. Parallel Reduction in Resource Lambda-Calculus. 7th Asian Symposium on Programming Languages and Systems (APLAS 2009), Dec 2009, Seoul, South Korea. pp.226-242, ⟨10.1007/978-3-642-10672-9_17⟩. ⟨hal-00699013⟩
• 
  Michele Pagani. The Cut-Elimination Thereom for Differential Nets with Promotion. 9th International Conference on Typed Lambda Calculi and Applications (TLCA 2009), Jul 2009, Brasilia, Brazil. pp.219-233, ⟨10.1007/978-3-642-02273-9_17⟩. ⟨hal-00698974⟩
• 
  Philippe Gaucher. Towards a homotopy theory of higher dimensional transition systems. Theory and Applications of Categories, 2011, 25 (12), pp.295-341. ⟨hal-00532852⟩
• 
  Philippe Gaucher. Directed algebraic topology and higher dimensional transition system. New York Journal of Mathematics, 2010, 16, pp.409-461. ⟨hal-00495670⟩
• 
  Philippe Gaucher. Homotopical interpretation of globular complex by multipointed d-space. Theory and Applications of Categories, 2009, 22 (22), pp.588-621. ⟨hal-00495657⟩
• 
  Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Logics for Unordered Trees with Data Constraints. Journal of Computer and System Sciences, 2018, pp.40. ⟨hal-01176763v1⟩
• 
  Vincent Danos, Jérôme Feret, Walter Fontana, Jean Krivine. Abstract Interpretation of Cellular Signalling Networks. the 9th International Conference on Verification, Model Checking and Abstract Interpretation - VMCAI'08, Jan 2008, San Francisco, United States. pp.83-97, ⟨10.1007/978-3-540-78163-9_11⟩. ⟨inria-00528352⟩
• 
  Pascal Lafourcade, Denis Lugiez, Ralf Treinen. Intruder deduction for the equational theory of Abelian groups with distributive encryption. Information and Computation, 2007, 205 (4), pp.581-623. ⟨10.1016/j.ic.2006.10.008⟩. ⟨hal-00496353⟩
• 
  Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen. Symbolic Protocol Analysis for Monoidal Equational Theories. Information and Computation, 2008, 206 (2-4), pp.312-351. ⟨10.1016/j.ic.2007.07.005⟩. ⟨hal-00496352⟩
• 
  Gabriel Radanne, Jérôme Vouillon, Vincent Balat, Vasilis Papavasileiou. ELIOM: tierless Web programming from the ground up . IFL, Aug 2016, Leuven, Belgium. ⟨10.1145/3064899.3064901⟩. ⟨hal-01407898v2⟩
• 
  Étienne Miquey. A Classical Sequent Calculus with Dependent Types. 2017. ⟨hal-01519929v1⟩
• 
  Nicolas Jeannerod, Yann Régis-Gianas, Ralf Treinen. Having Fun With 31.521 Shell Scripts. 2017. ⟨hal-01513750⟩
• 
  Cyrille Chenavier. A Lattice Formulation of the F 4 Completion Procedure. 2017. ⟨hal-01489200v1⟩
• 
  Cyrille Chenavier. Reduction Operators and Completion of Rewriting Systems. Journal of Symbolic Computation, In press. ⟨hal-01325907v2⟩
• 
  Étienne Miquey. A Classical Sequent Calculus with Dependent Types . 26th European Symposium on Programming, Apr 2017, Uppsala, Sweden. ⟨hal-01375977v3⟩
• 
  Amina Doumane. Constructive completeness for the linear-time µ-calculus. Conference on Logic in Computer Science 2017, Jun 2017, Reykjavik, Iceland. ⟨hal-01430737⟩
• 
  Jean-Jacques Levy, Ran Chen. Strongly Connected Components in graphs, formal proof of Tarjan1972 algorithm. Groupe de travail LTP du GDR GPL , Nov 2016, Orsay, France. 2016. ⟨hal-01422227⟩
• 
  Ran Chen, Jean-Jacques Levy. Formal proofs of two algorithms for strongly connected components in graphs. 2016. ⟨hal-01422216⟩
• 
  Ran Chen, Jean-Jacques Lévy. Une preuve formelle de l'algorithme de Tarjan-1972 pour trouver les composantes fortement connexes dans un graphe. JFLA 2017 - Vingt-huitièmes Journées Francophones des Langages Applicatifs, Jan 2017, Gourette, France. ⟨hal-01422215⟩
• 
  Thibaut Girka, David Mentré, Yann Régis-Gianas. Oracle-based Differential Operational Semantics (long version). [Research Report] Université Paris Diderot / Sorbonne Paris Cité. 2016. ⟨hal-01419860⟩

516

387