The SCEAS System
| |||||||

## Search the dblp DataBase
Michel Parigot:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Michel Parigot, Elisabeth Pelz
**A logical formalism for the study of the infinite behaviour of Petri nets.**[Citation Graph (0, 0)][DBLP] Applications and Theory in Petri Nets, 1985, pp:346-361 [Conf] - Michel Parigot
**On the Computational Interpretation of Negation.**[Citation Graph (0, 0)][DBLP] CSL, 2000, pp:472-484 [Conf] - Michel Parigot
**On the Representation of Data in Lambda-Calculus.**[Citation Graph (0, 0)][DBLP] CSL, 1989, pp:309-321 [Conf] - Michel Parigot
**Programming with Proofs: A Second Order Type Theory.**[Citation Graph (0, 0)][DBLP] ESOP, 1988, pp:145-159 [Conf] - Michel Parigot
**Strong Normalization of Second Order Symmetric lambda-Calculus.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2000, pp:442-453 [Conf] - Michel Parigot
**Automata, Games, and Positive Monadic Theories of Trees.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:44-57 [Conf] - Michel Parigot
**Classical Proofs as Programs.**[Citation Graph (0, 0)][DBLP] Kurt Gödel Colloquium, 1993, pp:263-276 [Conf] - Michel Parigot
**Strong Normalization for Second Order Classical Natural Deduction**[Citation Graph (0, 0)][DBLP] LICS, 1993, pp:39-46 [Conf] - Pascal Manoury, Michel Parigot, Marianna Simonot
**ProPre A Programming Language with Proofs.**[Citation Graph (0, 0)][DBLP] LPAR, 1992, pp:484-486 [Conf] - Michel Parigot
**Free Deduction: An Analysis of "Computations" in Classical Logic.**[Citation Graph (0, 0)][DBLP] RCLP, 1991, pp:361-380 [Conf] - Michel Parigot
**Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction.**[Citation Graph (0, 0)][DBLP] LPAR, 1992, pp:190-201 [Conf] - Michel Parigot
**Internal Labellings in Lambda-Calculus.**[Citation Graph (0, 0)][DBLP] MFCS, 1990, pp:439-445 [Conf] - Michel Parigot, Paul Rozière
**Constant Time Reductions in Lambda-Caculus.**[Citation Graph (0, 0)][DBLP] MFCS, 1993, pp:608-617 [Conf] - Michel Parigot
**On Constructive Existence.**[Citation Graph (0, 0)][DBLP] TYPES, 2004, pp:268-273 [Conf] - Jean-Louis Krivine, Michel Parigot
**Programming with Proofs.**[Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1990, v:26, n:3, pp:149-167 [Journal] - Michel Parigot
**Theories D'Arbres.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1982, v:47, n:4, pp:841-853 [Journal] - Michel Parigot
**Proofs of Strong Normalisation for Second Order Classical Natural Deduction.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1997, v:62, n:4, pp:1461-1479 [Journal] - Michel Parigot
**Recursive Programming with Proofs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1992, v:94, n:2, pp:335-336 [Journal] - Michel Parigot, Elisabeth Pelz
**A Logical Approach of Petri Net Languages.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1985, v:39, n:, pp:155-169 [Journal] **A Proof Calculus Which Reduces Syntactic Bureaucracy.**[Citation Graph (, )][DBLP]**Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |