Abstract:
Down with the bureaucracy of syntax! Pattern matching for classical linear logic This paper introduces a new way of attaching proof terms to proof trees for classical linear logic, which bears a close resemblance to the way that pattern matching is used in programming languages. It equates the same proofs that are equated by proof nets, in the formulation of proof nets introduced by Dominic Hughes and Rob van Glabbeek; and goes beyond that formulation in handling exponentials and units. It provides a symmetric treatment of all the connectives, and may provide programmers with improved insight into connectives such as “par ” and “why not ” that are difficult to treat in programming languages based on an intuitionistic formulation of linear logic. This paper uses colour to enhance its presentation. If the URL below is not blue, follow it for the colour version.
