Skip to Main content Skip to Navigation

inria-00098848v1  Journal articles
Hazel EverettFerran HurtadoMarc Noy. Stabbing information of a simple polygon
Discrete Applied Mathematics, Elsevier, 1999, 91 (1-3), pp.67-92
hal-02487175v2  Journal articles
Denis KuperbergLaureline PinaultDamien Pous. Cyclic proofs, system T, and the power of contraction
Proceedings of the ACM on Programming Languages, ACM, 2021, ⟨10.1145/3434282⟩
hal-01673518v2  Theses
Frédéric Gilbert. Extending higher-order logic with predicate subtyping
Logic in Computer Science [cs.LO]. Université Sorbonne Paris Cité; Université Paris Diderot, 2018. English
inria-00334006v1  Conference papers
Sylvain Salvati. Syntactic Descriptions: a Type System for Solving Matching Equations in the Linear lambda-Calculus.
17th International Conference on Rewriting Techniques and Applications, RTA 2006, 2006, Seattle, United States. pp.151-165
hal-02101921v1  Reports
Romain KervarcPierre Lescanne. Explicit Pure Type Systems for the Lambda-Cube
[Research Report] LIP RR-2004-08, Laboratoire de l'informatique du parallélisme. 2004, 2+45p
hal-01182688v2  Journal articles
Denis BonheureFrançois Hamel. One-dimensional symmetry and Liouville type results for the fourth order Allen-Cahn equation in ℝ N
Chinese Annals of Mathematics - Series B, Springer Verlag, 2017, Special Issue in Honor of Haim Brezis, 38 (1), pp.149 - 172. ⟨10.1007/s11401-016-1065-2⟩
hal-01989726v1  Journal articles
Jasmin Christian BlanchetteLorenzo GheriAndrei PopescuDmitriy Traytel. Bindings as Bounded Natural Functors
Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (POPL), pp.1-34. ⟨10.1145/3290335⟩
hal-02102423v1  Reports
Romain Kervac. Explicit pure type systems, subject reduction and preservation of strong normalisation
[Research Report] Laboratoire de l'informatique du parallélisme. 2006, 2+69p
hal-03143359v3  Conference papers
Michael Färber. Safe, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo Rewriting
11th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’22), Jan 2022, Philadelphia, PA, United States. ⟨10.1145/3497775.3503683⟩
hal-02879289v1  Conference papers
Xavier GoaocEmo Welzl. Convex Hulls of Random Order Types
SoCG 2020 - 36th International Symposium on Computational Geometry, Jun 2020, Zürich / Virtual, Switzerland. pp.49:1--49:15, ⟨10.4230/LIPIcs.SoCG.2020.49⟩
hal-02101842v1  Reports
Judicael Courant. A module calculus for Pure Type Systems. (Preliminary Version)
[Research Report] LIP RR-1996-31, Laboratoire de l'informatique du parallélisme. 1996, 2+18p
hal-02102422v1  Reports
Romain Kervac. Systèmes de types purs et séquents classique.
[Rapport de recherche] LIP RR-2006-36, Laboratoire de l'informatique du parallélisme. 2006, 2+27p