Home » Team publications


Publications  for  the  collection  HAL LS2N-GALLINETTE  for  2022

Total of the publications found : 14


Overview of LS2N-GALLINETTE publications by types
ART_INT
COMM_INT
COMM_NAT
OUV
THESE
46112

International journals with reviewing committee (ART_INT)

    • [1] M. Lennon-Bertrand, K. Maillard, N. Tabareau, . Tanter. Gradualizing the Calculus of Inductive Constructions. In ACM Transactions on Programming Languages and Systems (TOPLAS) ; éd. ACM, 2022.
      https://hal.archives-ouvertes.fr/hal-02896776v5
    • [2] T. Zimmermann, J. Coolen, J. Gross, P. Pédrot, G. Gilbert. The Advantages of Maintaining a Multitask, Project-Specific Bot: An Experience Report. In IEEE Software ; éd. Institute of Electrical and Electronics Engineers, 2022.
      https://hal.inria.fr/hal-03479327v2
    • [3] K. Maillard, M. Lennon-Bertrand, N. Tabareau, . Tanter. A Reasonably Gradual Type Theory. In Proceedings of the ACM on Programming Languages ; éd. ACM, 2022.
      https://hal.inria.fr/hal-03596652v2
    • [4] L. Pujet, N. Tabareau. Observational Equality: Now For Good. In POPL 2022: Symposium on Principles of Programming Languages, janvier 2022, Philadelphia, états-Unis.In Proceedings of the ACM on Programming Languages ; éd. ACM, 2022, vol. 6, num. POPL.
      https://hal.inria.fr/hal-03367052v4

International conferences with reviewing committee (COMM_INT)

    • [5] G. Jaber, D. Sangiorgi. Games, mobile processes, Dfunctions. In CSL 2022 - 30th EACSL Annual Conference on Computer Science Logic, février 2022, Göttingen, Allemagne.
      https://hal.science/hal-03407123
    • [6] M. Baillon, A. Mahboubi, P. Pédrot. Gardening with the Pythia A model of continuity in a dependent setting. In CSL 2022 - Computer Science Logic, février 2022, Göttingen, Allemagne.
      https://hal.inria.fr/hal-03510671
    • [7] Y. Forster, F. Kunze, N. Lauermann. Synthetic Kolmogorov Complexity in Coq. In ITP 2022 - 13th International Conference on Interactive Theorem Proving, août 2022, Haifa, Israël.
      https://hal.inria.fr/hal-03596267v2
    • [8] G. Munch-Maccagnoni, G. Scherer. Boxroot, fast movable GC roots for a better FFI. In ML Family Workshop, septembre 2022, Ljubljana, Slovénie.
      https://hal.inria.fr/hal-03910313
    • [9] G. Munch-Maccagnoni. Efficient “out of heap” pointers for multicore OCaml. In OCaml 2022 - OCaml Users and Developers Workshop, septembre 2022, Ljubljana, Slovénie.
      https://hal.inria.fr/hal-03910312
    • [10] N. Beldiceanu, J. Cheukam-Ngouonou, R. Douence, R. Gindullin, C. Quimper. Acquiring Maps of Interrelated Conjectures on Sharp Bounds. In CP 2022 - 28th International Conference on Principles and Practice of Constraint Programming, juillet 2022, Haifa, Israël.In Solnon, Christine (éds.), . Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2022.
      https://hal.science/hal-03789045

National conferences with reviewing committee (COMM_NAT)

    • [11] D. Cousineau, E. Crance, A. Mahboubi. Trakt : Uniformiser les types pour automatiser les preuves (démonstration). In JFLA 2022 - 33èmes Journées Francophones des Langages Applicatifs, juin 2022, Saint-Médard-d'Excideuil, France.In Chantal Keller (éds.), . , 2022.
      https://hal.inria.fr/hal-03626851

Books - books sections - directions of work or proceedings (OUV)

    • [12] Y. Forster. Parametric Church’s Thesis: Synthetic Computability Without Choice. In Logical Foundations of Computer Science. 16-12-2022
      https://hal.inria.fr/hal-03889493

PhD Thesis (THESE)

Copyright : LS2N 2017 - Legal notices - 
 -