LFCS Seminar: Tuesday 7th July: Pablo Donato Title: Towards a Curry-Howard correspondence for existential graphs Abstract: In this talk, I will introduce "scroll nets", a novel diagrammaticformalism for representing proofs and programs. As the nameindicates, it is based on the "scroll", a topological notation forlogical implication invented by Charles S. Peirce at the end of the 19thcentury for his system of existential graphs (EGs). In order to obtain aproper notion of static proof object from the inference rules of EGs, weadd on top of the scroll a graphical syntax inspired by proof nets whichturns out to be an instance of Milner's notion of bigraph, thus alsoenjoying an algebraic term syntax. I will first motivate the diagrammatic notation from a philosophicalstandpoint, arguing that it captures the smallest motions ofdeductive reasoning in a very natural way, abstaining from anysymbolic means of representation. I will then show how to expressproofs in minimal implicative logic by simulating the rules of naturaldeduction. Through the Curry-Howard correspondence, this will leadus to identify a notion of detour that seems to generalize that ofsimply-typed lambda-calculus. I will present ongoing work to provideoperational and denotational semantics to scroll nets, as well as anadaptation of the normalization-by-evaluation technique to this newsetting. If time remains, I will sketch how to capture: 1. classicallogic and intuitionistic disjunction by considering a horizontalgeneralization of the scroll first proposed by Oostra; 2.intuitionistic subtraction through a further verticalgeneralization of my own. Jul 07 2026 16.10 - 17.00 LFCS Seminar: Tuesday 7th July: Pablo Donato Pablo Donato, Charles University, Prague https://pablogician.refl.fr/ Informatics Forum, G.03 This article was published on Monday 6 July 2026
LFCS Seminar: Tuesday 7th July: Pablo Donato Title: Towards a Curry-Howard correspondence for existential graphs Abstract: In this talk, I will introduce "scroll nets", a novel diagrammaticformalism for representing proofs and programs. As the nameindicates, it is based on the "scroll", a topological notation forlogical implication invented by Charles S. Peirce at the end of the 19thcentury for his system of existential graphs (EGs). In order to obtain aproper notion of static proof object from the inference rules of EGs, weadd on top of the scroll a graphical syntax inspired by proof nets whichturns out to be an instance of Milner's notion of bigraph, thus alsoenjoying an algebraic term syntax. I will first motivate the diagrammatic notation from a philosophicalstandpoint, arguing that it captures the smallest motions ofdeductive reasoning in a very natural way, abstaining from anysymbolic means of representation. I will then show how to expressproofs in minimal implicative logic by simulating the rules of naturaldeduction. Through the Curry-Howard correspondence, this will leadus to identify a notion of detour that seems to generalize that ofsimply-typed lambda-calculus. I will present ongoing work to provideoperational and denotational semantics to scroll nets, as well as anadaptation of the normalization-by-evaluation technique to this newsetting. If time remains, I will sketch how to capture: 1. classicallogic and intuitionistic disjunction by considering a horizontalgeneralization of the scroll first proposed by Oostra; 2.intuitionistic subtraction through a further verticalgeneralization of my own. Jul 07 2026 16.10 - 17.00 LFCS Seminar: Tuesday 7th July: Pablo Donato Pablo Donato, Charles University, Prague https://pablogician.refl.fr/ Informatics Forum, G.03 This article was published on Monday 6 July 2026
Jul 07 2026 16.10 - 17.00 LFCS Seminar: Tuesday 7th July: Pablo Donato Pablo Donato, Charles University, Prague https://pablogician.refl.fr/