Michel Parigot

According to our database1, Michel Parigot authored at least 28 papers between 1982 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Spinal Atomic Lambda-Calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2016
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
Log. Methods Comput. Sci., 2016

2013
A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2011
A Symmetric Natural Deduction.
Proceedings of the TABLEAUX 2011, 2011

A Tentative Atomic Calculus for Natural Deduction.
Proceedings of the TABLEAUX 2011, 2011

2010
A Proof Calculus Which Reduces Syntactic Bureaucracy.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2004
On Constructive Existence.
Proceedings of the Types for Proofs and Programs, International Workshop, 2004

2000
Strong Normalization of Second Order Symmetric lambda-Calculus.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

On the Computational Interpretation of Negation.
Proceedings of the Computer Science Logic, 2000

1997
Proofs of Strong Normalisation for Second Order Classical Natural Deduction.
J. Symb. Log., 1997

1993
Constant Time Reductions in Lambda-Caculus.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Strong Normalization for Second Order Classical Natural Deduction
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Classical Proofs as Programs.
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992
Recursive Programming with Proofs.
Theor. Comput. Sci., 1992

Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction.
Proceedings of the Logic Programming and Automated Reasoning, 1992

ProPre A Programming Language with Proofs.
Proceedings of the Logic Programming and Automated Reasoning, 1992

1991
Free Deduction: An Analysis of "Computations" in Classical Logic.
Proceedings of the Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990, 1991

1990
Programming with Proofs.
J. Inf. Process. Cybern., 1990

Internal Labellings in Lambda-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989
On the Representation of Data in Lambda-Calculus.
Proceedings of the CSL '89, 1989

1988
Programming with Proofs: A Second Order Type Theory.
Proceedings of the ESOP '88, 1988

1987
Automata, Games, and Positive Monadic Theories of Trees.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1985
A Logical Approach of Petri Net Languages.
Theor. Comput. Sci., 1985

A logical formalism for the study of the infinite behaviour of Petri nets.
Proceedings of the Advances in Petri Nets 1985, 1985

1983
Le modèle Compagnon de la THéOrie des arbres.
Math. Log. Q., 1983

1982
Theories D'Arbres.
J. Symb. Log., 1982


  Loading...