Theories D'Arbres. - Michel Parigot (J. Symb. Log., 1982)

Le modèle Compagnon de la THéOrie des arbres. - Michel Parigot (Math. Log. Q., 1983)

A logical formalism for the study of the infinite behaviour of Petri nets. - Michel Parigot; Elisabeth Pelz (Applications and Theory in Petri Nets, 1985)

A Logical Approach of Petri Net Languages. - Michel Parigot; Elisabeth Pelz (Theor. Comput. Sci., 1985)

Automata, Games, and Positive Monadic Theories of Trees. - Michel Parigot (FSTTCS, 1987)

Programming with Proofs: A Second Order Type Theory. - Michel Parigot (ESOP, 1988)

On the Representation of Data in Lambda-Calculus. - Michel Parigot (CSL, 1989)

Internal Labellings in Lambda-Calculus. - Michel Parigot (MFCS, 1990)

Programming with Proofs. - Jean-Louis Krivine; Michel Parigot (J. Inf. Process. Cybern., 1990)

Free Deduction: An Analysis of "Computations" in Classical Logic. - Michel Parigot (RCLP, 1991)

ProPre A Programming Language with Proofs. - Pascal Manoury; Michel Parigot; Marianne Simonot (LPAR, 1992)

Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. - Michel Parigot (LPAR, 1992)

Recursive Programming with Proofs. - Michel Parigot (Theor. Comput. Sci., 1992)

Classical Proofs as Programs. - Michel Parigot (Kurt Gödel Colloquium, 1993)

Strong Normalization for Second Order Classical Natural Deduction - Michel Parigot (LICS, 1993)

Constant Time Reductions in Lambda-Caculus. - Michel Parigot; Paul Rozière (MFCS, 1993)

Proofs of Strong Normalisation for Second Order Classical Natural Deduction. - Michel Parigot (J. Symb. Log., 1997)

On the Computational Interpretation of Negation. - Michel Parigot (CSL, 2000)

Strong Normalization of Second Order Symmetric lambda-Calculus. - Michel Parigot (FSTTCS, 2000)

On Constructive Existence. - Michel Parigot (TYPES, 2004)

A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae. - Paola Bruscoli; Alessio Guglielmi; Tom Gundersen; Michel Parigot (LPAR (Dakar), 2010)

A Proof Calculus Which Reduces Syntactic Bureaucracy. - Alessio Guglielmi; Tom Gundersen; Michel Parigot (RTA, 2010)

A Tentative Atomic Calculus for Natural Deduction. - Tom Gundersen; Michel Parigot (TABLEAUX (Workshops, Tutorials, and Short Papers), 2011)

A Symmetric Natural Deduction. - Michel Parigot (TABLEAUX (Workshops, Tutorials, and Short Papers), 2011)

Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing. - Tom Gundersen; Willem Heijltjes; Michel Parigot (LICS, 2013)

A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus. - Tom Gundersen; Willem Heijltjes; Michel Parigot (LPAR, 2013)

Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae - Paola Bruscoli; Alessio Guglielmi; Tom Gundersen; Michel Parigot (Log. Methods Comput. Sci., 2016)

Spinal Atomic Lambda-Calculus. - David Sherratt; Willem Heijltjes; Tom Gundersen; Michel Parigot (FoSSaCS, 2020)