Michel Parigot

1.3k total citations
15 papers, 199 citations indexed

About

Michel Parigot is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Management Information Systems. According to data from OpenAlex, Michel Parigot has authored 15 papers receiving a total of 199 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 7 papers in Computational Theory and Mathematics and 1 paper in Management Information Systems. Recurrent topics in Michel Parigot's work include Logic, Reasoning, and Knowledge (8 papers), Logic, programming, and type systems (5 papers) and Advanced Algebra and Logic (3 papers). Michel Parigot is often cited by papers focused on Logic, Reasoning, and Knowledge (8 papers), Logic, programming, and type systems (5 papers) and Advanced Algebra and Logic (3 papers). Michel Parigot collaborates with scholars based in France and United Kingdom. Michel Parigot's co-authors include Jean-Louis Krivine, Андрей Воронков, Alessio Guglielmi and Michel Lemoine and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Journal of Symbolic Logic.

In The Last Decade

Michel Parigot

15 papers receiving 181 citations

Peers

Michel Parigot

AI

CTM

CNC

SOFTW

IS

Alban Ponse Netherlands

Corina Ĉırstea United Kingdom

Vincent van Oostrom Netherlands

Steffen van Bakel United Kingdom

Fairouz Kamareddine United Kingdom

Uwe Waldmann Germany

Bartek Klin Poland

Noam Zeilberger France

Witold Charatonik Poland

Matthieu Sozeau France

Alban Ponse Netherlands

Michel Parigot

185 ×1.1

AI

202 ×1.3

CTM

22 ×1.4

CNC

21 ×1.4

SOFTW

9 ×0.6

IS

Citations per year, relative to Michel Parigot Michel Parigot (= 1×) peers Alban Ponse

Countries citing papers authored by Michel Parigot

Since Specialization

Citations

This map shows the geographic impact of Michel Parigot's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michel Parigot with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michel Parigot more than expected).

Fields of papers citing papers by Michel Parigot

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michel Parigot. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michel Parigot. The network helps show where Michel Parigot may publish in the future.

Co-authorship network of co-authors of Michel Parigot

This figure shows the co-authorship network connecting the top 25 collaborators of Michel Parigot. A scholar is included among the top collaborators of Michel Parigot based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michel Parigot. Michel Parigot is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

15 of 15 papers shown

1.

Guglielmi, Alessio, et al.. (2016). Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae. Logical Methods in Computer Science. Volume 12, Issue 2. 1 indexed citations

2.

Parigot, Michel, et al.. (2013). Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing. Pure (University of Bath). 311–320. 3 indexed citations

3.

Parigot, Michel. (2002). Strong normalization for second order classical natural deduction. 39–46. 21 indexed citations

4.

Parigot, Michel & Андрей Воронков. (2000). Proceedings of the 7th international conference on Logic for programming and automated reasoning. Untitled Event. 13 indexed citations

5.

Parigot, Michel & Андрей Воронков. (2000). Logic for Programming and Automated Reasoning. DIAL (Catholic University of Leuven). 8 indexed citations

6.

Parigot, Michel, et al.. (2000). Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. 2 indexed citations

7.

Parigot, Michel. (1997). Proofs of strong normalisation for second order classical natural deduction. Journal of Symbolic Logic. 62(4). 1461–1479. 57 indexed citations

8.

Parigot, Michel. (1993). Church-Rosser property in classical free deduction. 273–296. 2 indexed citations

9.

Parigot, Michel. (1992). Recursive programming with proofs. Theoretical Computer Science. 94(2). 335–356. 35 indexed citations

10.

Parigot, Michel. (1992). Free deduction: An analysis of “Computations” in classical logic. Lecture notes in computer science. 361–380. 6 indexed citations

11.

Krivine, Jean-Louis & Michel Parigot. (1990). Programming with proofs. Journal of automata, languages and combinatorics. 26(3). 149–167. 32 indexed citations

12.

Lemoine, Michel, et al.. (1989). Method Driven Programming.. IFIP Congress. 272. 351–356. 2 indexed citations

13.

Parigot, Michel, et al.. (1985). A logical approach of Petri net languages. Theoretical Computer Science. 39. 155–169. 10 indexed citations

14.

Parigot, Michel. (1983). LE MODÈLE COMPAGNON DE LA THÉORIE DES ARBRES. Mathematical logic quarterly. 29(3). 137–150. 1 indexed citations

15.

Parigot, Michel. (1982). Théories d'arbres. Journal of Symbolic Logic. 47(4). 841–853. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact