| 2009 |
|---|
| 21 | EE | Paola Bruscoli,
Alessio Guglielmi,
Tom Gundersen,
Michel Parigot:
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
CoRR abs/0903.5392: (2009) |
| 2004 |
|---|
| 20 | EE | Michel Parigot:
On Constructive Existence.
TYPES 2004: 268-273 |
| 2000 |
|---|
| 19 | | Michel Parigot,
Andrei Voronkov:
Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000, Proceedings
Springer 2000 |
| 18 | EE | Michel Parigot:
On the Computational Interpretation of Negation.
CSL 2000: 472-484 |
| 17 | EE | Michel Parigot:
Strong Normalization of Second Order Symmetric lambda-Calculus.
FSTTCS 2000: 442-453 |
| 1997 |
|---|
| 16 | | Michel Parigot:
Proofs of Strong Normalisation for Second Order Classical Natural Deduction.
J. Symb. Log. 62(4): 1461-1479 (1997) |
| 1993 |
|---|
| 15 | | Michel Parigot:
Classical Proofs as Programs.
Kurt Gödel Colloquium 1993: 263-276 |
| 14 | | Michel Parigot:
Strong Normalization for Second Order Classical Natural Deduction
LICS 1993: 39-46 |
| 13 | | Michel Parigot,
Paul Rozière:
Constant Time Reductions in Lambda-Caculus.
MFCS 1993: 608-617 |
| 1992 |
|---|
| 12 | | Michel Parigot:
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction.
LPAR 1992: 190-201 |
| 11 | | Pascal Manoury,
Michel Parigot,
Marianna Simonot:
ProPre A Programming Language with Proofs.
LPAR 1992: 484-486 |
| 10 | | Michel Parigot:
Recursive Programming with Proofs.
Theor. Comput. Sci. 94(2): 335-336 (1992) |
| 1991 |
|---|
| 9 | | Michel Parigot:
Free Deduction: An Analysis of "Computations" in Classical Logic.
RCLP 1991: 361-380 |
| 1990 |
|---|
| 8 | | Michel Parigot:
Internal Labellings in Lambda-Calculus.
MFCS 1990: 439-445 |
| 7 | | Jean-Louis Krivine,
Michel Parigot:
Programming with Proofs.
Elektronische Informationsverarbeitung und Kybernetik 26(3): 149-167 (1990) |
| 1989 |
|---|
| 6 | | Michel Parigot:
On the Representation of Data in Lambda-Calculus.
CSL 1989: 309-321 |
| 1988 |
|---|
| 5 | | Michel Parigot:
Programming with Proofs: A Second Order Type Theory.
ESOP 1988: 145-159 |
| 1987 |
|---|
| 4 | | Michel Parigot:
Automata, Games, and Positive Monadic Theories of Trees.
FSTTCS 1987: 44-57 |
| 1985 |
|---|
| 3 | | Michel Parigot,
Elisabeth Pelz:
A logical formalism for the study of the infinite behaviour of Petri nets.
Applications and Theory in Petri Nets 1985: 346-361 |
| 2 | | Michel Parigot,
Elisabeth Pelz:
A Logical Approach of Petri Net Languages.
Theor. Comput. Sci. 39: 155-169 (1985) |
| 1982 |
|---|
| 1 | | Michel Parigot:
Theories D'Arbres.
J. Symb. Log. 47(4): 841-853 (1982) |
