Author of the publication

Binding Logic: Proofs and Models.

, , and . LPAR, volume 2514 of Lecture Notes in Computer Science, page 130-144. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Les métamorphoses du calcul : une étonnante histoire de mathématiques. Le Pommier, (2007)Formal verification of conflict detection algorithms., , , and . Int. J. Softw. Tools Technol. Transf., 4 (3): 371-380 (2003)Binding Logic: proofs and models., , and . CoRR, (2023)Causal Graph Dynamics., and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 54-66. Springer, (2012)Lambda-calculus, Combinators and the Comprehension Scheme.. TLCA, volume 902 of Lecture Notes in Computer Science, page 154-170. Springer, (1995)Axioms vs. Rewrite Rules: From Completeness to Cut Elimination.. FroCoS, volume 1794 of Lecture Notes in Computer Science, page 62-72. Springer, (2000)Binding Logic: Proofs and Models., , and . LPAR, volume 2514 of Lecture Notes in Computer Science, page 130-144. Springer, (2002)Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory.. FTP (LNCS Selection), volume 1761 of Lecture Notes in Computer Science, page 1-22. Springer, (1998)What is a Theory ?. CoRR, (2023)Linear Lambda-Calculus is Linear., and . FSCD, volume 228 of LIPIcs, page 21:1-21:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)