Add to ORKGWe offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic). This graphical calculus of proofs inherits good features from each, but is not constrained by them. By the Curry-Howard isomorphism, the representation applies equally to the lambda calculus, offering an alternative dia-grammatic representation of functional computations
20 pagee, to be published in the proceedings of LICS08International audienceThe Geometry of Interact...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
Colloque sur invitation.In this talk, we consider the problem to have efficient methods to construct...
The Curry-Howard isomorphism 1 is the basis of typed functional programming. By means of this isomor...
AbstractWe present a graphical calculus, which allows mathematical formulae to be represented and re...
Abstract. Given an intuitionistic proof net of linear logic, we abstract an order between its atomic...
International audienceSince the very beginning of the theory of linear logic it is known how to repr...
International audienceWe present Intuitionistic Combinatorial Proofs (ICPs), a concrete geometric se...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
Since its inception in 1987 linear logic (LL, [3]) has changed the proof theoreti-cal way of dealing...
Linear logics have been shown to be able to embed both rewriting-based approaches and process calcul...
AbstractInteraction nets are graph rewriting systems which are a generalisation of proof nets for cl...
Deduction graphs [3] provide a formalism for natural deduction, where the deductions have the struct...
Mathematical logic is the logical basis of the modern computer. It is important for the development ...
Peirce and Frege both distinguished between the propositional content of an assertion and the assert...
20 pagee, to be published in the proceedings of LICS08International audienceThe Geometry of Interact...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
Colloque sur invitation.In this talk, we consider the problem to have efficient methods to construct...
The Curry-Howard isomorphism 1 is the basis of typed functional programming. By means of this isomor...
AbstractWe present a graphical calculus, which allows mathematical formulae to be represented and re...
Abstract. Given an intuitionistic proof net of linear logic, we abstract an order between its atomic...
International audienceSince the very beginning of the theory of linear logic it is known how to repr...
International audienceWe present Intuitionistic Combinatorial Proofs (ICPs), a concrete geometric se...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
Since its inception in 1987 linear logic (LL, [3]) has changed the proof theoreti-cal way of dealing...
Linear logics have been shown to be able to embed both rewriting-based approaches and process calcul...
AbstractInteraction nets are graph rewriting systems which are a generalisation of proof nets for cl...
Deduction graphs [3] provide a formalism for natural deduction, where the deductions have the struct...
Mathematical logic is the logical basis of the modern computer. It is important for the development ...
Peirce and Frege both distinguished between the propositional content of an assertion and the assert...
20 pagee, to be published in the proceedings of LICS08International audienceThe Geometry of Interact...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
Colloque sur invitation.In this talk, we consider the problem to have efficient methods to construct...