λμ-calculus: an algorithmic interpretation of classical natural deduction M Parigot Logic Programming and Automated Reasoning: International Conference LPAR'92 …, 1992 | 905 | 1992 |
Proofs of strong normalisation for second order classical natural deduction M Parigot The Journal of Symbolic Logic 62 (4), 1461-1479, 1997 | 185 | 1997 |
Classical proofs as programs M Parigot Computational Logic and Proof Theory: Third Kurt Gödel Colloquium, KGC'93 …, 1993 | 140 | 1993 |
Strong normalization for second order classical natural deduction M Parigot [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science …, 1993 | 127 | 1993 |
Programming with proofs JL Krivine, M Parigot Journal of Information Processing and Cybernetics 26 (3), 149-167, 1990 | 119 | 1990 |
Free deduction: An analysis of “computations” in classical logic M Parigot Logic Programming: First Russian Conference on Logic Programming Irkutsk …, 1992 | 107 | 1992 |
Recursive programming with proofs M Parigot Theoretical Computer Science 94 (2), 335-356, 1992 | 105 | 1992 |
A proof calculus which reduces syntactic bureaucracy A Guglielmi, T Gundersen, M Parigot Proceedings of the 21st International Conference on Rewriting Techniques and …, 2010 | 79 | 2010 |
Programming with proofs: a second order type theory M Parigot European Symposium on Programming, 145-159, 1988 | 73 | 1988 |
On the representation of data in lambda-calculus M Parigot International Workshop on Computer Science Logic, 309-321, 1989 | 53 | 1989 |
A logical approach of Petri net languages M Parigot, E Pelz Theoretical Computer Science 39, 155-169, 1985 | 44 | 1985 |
Atomic lambda calculus: A typed lambda-calculus with explicit sharing T Gundersen, W Heijltjes, M Parigot 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 311-320, 2013 | 39 | 2013 |
A quasipolynomial cut-elimination procedure in deep inference via atomic flows and threshold formulae P Bruscoli, A Guglielmi, T Gundersen, M Parigot Logic for Programming, Artificial Intelligence, and Reasoning: 16th …, 2010 | 30 | 2010 |
A quasipolynomial cut-elimination procedure in deep inference via atomic flows and threshold formulae P Bruscoli, A Guglielmi, T Gundersen, M Parigot Logic for Programming, Artificial Intelligence, and Reasoning: 16th …, 2010 | 30 | 2010 |
Théories d'arbres M Parigot The Journal of Symbolic Logic 47 (4), 841-853, 1982 | 25 | 1982 |
Théories d'arbres M Parigot The Journal of Symbolic Logic 47 (4), 841-853, 1982 | 25 | 1982 |
On the computational interpretation of negation M Parigot Computer Science Logic: 14th InternationalWorkshop, CSL 2000 Annual …, 2000 | 22 | 2000 |
A logical formalism for the study of the finite behaviour of Petri nets M Parigot, E Pelz European Workshop on Applications and Theory in Petri Nets, 346-361, 1985 | 16 | 1985 |
Quasipolynomial normalisation in deep inference via atomic flows and threshold formulae P Bruscoli, A Guglielmi, T Gundersen, M Parigot Logical Methods in Computer Science 12, 2016 | 14 | 2016 |
Internal labellings in lambda-calculus M Parigot Mathematical Foundations of Computer Science 1990: Banská Bystrica …, 1990 | 13 | 1990 |