Basic Elements of Logical Graphs

08/05/2022
by   Lucas Dixon, et al.
0

We considers how a particular kind of graph corresponds to multiplicative intuitionistic linear logic formula. The main feature of the graphical notation is that it absorbs certain symmetries between conjunction and implication. We look at the basic definitions and present details of an implementation in the functional programming language Standard ML. This provides a functional approach to graph traversal and demonstrates how graph isomorphism be implemented in just a few lines of readable code. This works takes the initial steps towards a graphical language and toolkit for working with logic formula and derivations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

8523 means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs

Along the lines of the Abramsky "Proofs-as-Processes" program, we presen...
research
08/27/2020

Memoized Pull-Tabbing for Functional Logic Programming

Pull-tabbing is an evaluation technique for functional logic programs wh...
research
05/09/2016

HLinear: Exact Dense Linear Algebra in Haskell

We present an implementation in the functional programming language Hask...
research
06/08/2023

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic

This work is the first exploration of proof-theoretic semantics for a su...
research
10/05/2021

Local certification of MSO properties for bounded treedepth graphs

The graph model checking problem consists in testing whether an input gr...
research
07/08/1999

No information can be conveyed by certain events: The case of the clever widows of Fornicalia and the Stobon Oracle

In this short article, we look at an old logical puzzle, its solution an...
research
04/13/2023

Kind Inference for the FreeST Programming Language

We present a kind inference algorithm for the FREEST programming languag...

Please sign up or login with your details

Forgot password? Click here to reset