Michel Parigot

29 papers A* 2A 1B 9Journal 7Unranked 10
YearRankTypeTitle / Venue / Authors
2020 B conf
Spinal Atomic Lambda-Calculus.
FoSSaCS
David Sherratt, Willem Heijltjes, Tom Gundersen, Michel Parigot
2016 J jnl
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
Log. Methods Comput. Sci.
Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, Michel Parigot
2013 B conf
A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus.
LPAR
Tom Gundersen, Willem Heijltjes, Michel Parigot
2013 A* conf
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing.
LICS
Tom Gundersen, Willem Heijltjes, Michel Parigot
2011 — conf
A Symmetric Natural Deduction.
TABLEAUX (Workshops, Tutorials, and Short Papers)
Michel Parigot
2011 — conf
A Tentative Atomic Calculus for Natural Deduction.
TABLEAUX (Workshops, Tutorials, and Short Papers)
Tom Gundersen, Michel Parigot
2010 — conf
A Proof Calculus Which Reduces Syntactic Bureaucracy.
RTA
Alessio Guglielmi, Tom Gundersen, Michel Parigot
2010 — conf
A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae.
LPAR (Dakar)
Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, Michel Parigot
2004 — conf
On Constructive Existence.
TYPES
Michel Parigot
2000 B ed.
Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000, Proceedings
LPAR
Michel Parigot, Andrei Voronkov
2000 B conf
On the Computational Interpretation of Negation.
CSL
Michel Parigot
2000 — conf
Strong Normalization of Second Order Symmetric lambda-Calculus.
FSTTCS
Michel Parigot
1997 J jnl
Proofs of Strong Normalisation for Second Order Classical Natural Deduction.
J. Symb. Log.
Michel Parigot
1993 — conf
Classical Proofs as Programs.
Kurt Gödel Colloquium
Michel Parigot
1993 B conf
Constant Time Reductions in Lambda-Caculus.
MFCS
Michel Parigot, Paul Rozière
1993 A* conf
Strong Normalization for Second Order Classical Natural Deduction
LICS
Michel Parigot
1992 B conf
Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction.
LPAR
Michel Parigot
1992 B conf
ProPre A Programming Language with Proofs.
LPAR
Pascal Manoury, Michel Parigot, Marianne Simonot
1992 J jnl
Recursive Programming with Proofs.
Theor. Comput. Sci.
Michel Parigot
1991 — conf
Free Deduction: An Analysis of "Computations" in Classical Logic.
RCLP
Michel Parigot
1990 B conf
Internal Labellings in Lambda-Calculus.
MFCS
Michel Parigot
1990 J jnl
Programming with Proofs.
J. Inf. Process. Cybern.
Jean-Louis Krivine, Michel Parigot
1989 B conf
On the Representation of Data in Lambda-Calculus.
CSL
Michel Parigot
1988 A conf
Programming with Proofs: A Second Order Type Theory.
ESOP
Michel Parigot
1987 — conf
Automata, Games, and Positive Monadic Theories of Trees.
FSTTCS
Michel Parigot
1985 J jnl
A Logical Approach of Petri Net Languages.
Theor. Comput. Sci.
Michel Parigot, Elisabeth Pelz
1985 — conf
A logical formalism for the study of the infinite behaviour of Petri nets.
Applications and Theory in Petri Nets
Michel Parigot, Elisabeth Pelz
1983 J jnl
Le modèle Compagnon de la THéOrie des arbres.
Math. Log. Q.
Michel Parigot
1982 J jnl
Theories D'Arbres.
J. Symb. Log.
Michel Parigot