Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Michel Parigot
Observed names:
M. Parigot,
Parigot, Michel
Institutions:
Centre National de la Recherche Scientifique,
Université Paris Cité,
Institut de Recherche en Informatique Fondamentale
Observed institutions:
Centre National de la Recherche Scientifique,
Université Paris Cité,
Institut de Recherche en Informatique Fondamentale,
Laboratory Preuves, Programmes et Systèmes,
Université Paris Diderot
OpenAlex ID:
A5083676860
Works
43
Awards
3
λμ-Calculus: An algorithmic interpretation of classical natural deduction
2005
·
Michel Parigot
·
Springer eBooks
·
613
Proofs of strong normalisation for second order classical natural deduction
1997
·
Michel Parigot
·
Journal of Symbolic Logic
·
150
Strong normalization for second order classical natural deduction
2002
·
M. Parigot
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
93
Classical proofs as programs
2005
·
Michel Parigot
·
Springer eBooks
·
78
Programming with proofs
1990
·
Jean-Louis Krivine
, Michel Parigot
·
Journal of automata, languages and combinatorics
·
76
Recursive programming with proofs
1992
·
Michel Parigot
·
Theoretical Computer Science
·
75
PDF
Free deduction: An analysis of “Computations” in classical logic
1992
·
Michel Parigot
·
Lecture notes in computer science
·
71
A Proof Calculus Which Reduces Syntactic Bureaucracy
2010
·
Guglielmi, Alessio
, Gundersen, Tom
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
59
PDF
Programming with proofs: A second order type theory
1988
·
Michel Parigot
·
Lecture notes in computer science
·
51
PDF
On the representation of data in lambda-calculus
1990
·
Michel Parigot
·
Lecture notes in computer science
·
42
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing
2013
·
Tom Gundersen
, Willem Heijltjes
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
32
A logical approach of Petri net languages
1985
·
Michel Parigot
, Elisabeth Pelz
·
Theoretical Computer Science
·
30
Logic for Programming and Automated Reasoning
2000
·
Michel Parigot
, Андрей Воронков
·
Springer eBooks
·
26
Théories d'arbres
1982
·
Michel Parigot
·
Journal of Symbolic Logic
·
22
A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae
2010
·
Paola Bruscoli
, Alessio Guglielmi
, et al.
·
Lecture notes in computer science
·
21
PDF
Proceedings of the 7th international conference on Logic for programming and automated reasoning
2000
·
Michel Parigot
, Андрей Воронков
·
16
On the Computational Interpretation of Negation
2000
·
Michel Parigot
·
Lecture notes in computer science
·
16
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
2016
·
Paola Bruscoli
, Alessio Guglielmi
, et al.
·
Logical Methods in Computer Science
·
11
PDF
ProPre A programming language with proofs
2005
·
Pascal Manoury
, Michel Parigot
, et al.
·
Springer eBooks
·
11
Spinal Atomic Lambda-Calculus
2020
·
David Sherratt
, Willem Heijltjes
, et al.
·
Lecture notes in computer science
·
10
PDF
A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus
2013
·
Tom Gundersen
, Willem Heijltjes
, et al.
·
Lecture notes in computer science
·
10
PDF
Strong Normalization of Second Order Symmetric λ-Calculus
2000
·
Michel Parigot
·
Lecture notes in computer science
·
10
A logical formalism for the study of the finite behaviour of Petri nets
2005
·
Michel Parigot
, Elisabeth Pelz
·
Springer eBooks
·
9
Internal labellings in lambda-calculus
2005
·
Michel Parigot
·
Springer eBooks
·
8
Constant time reductions in λ-calculus
1993
·
Michel Parigot
, Paul Rozière
·
Lecture notes in computer science
·
5
Show more works
View as search
Works count:
43
Citation count:
1,570
H-index:
16
I10-index:
22
Year
Topic
Type