FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

This page contains an index consisting of author-provided keywords.

A
algebraic graph rewriting	A PBPO+ Graph Rewriting Tutorial
B
BPMN	Formalization and analysis of BPMN using graph transformation systems
C
category theory	PBPO+ Graph Rewriting in Context
causal graph	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
causality	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
Church encoding	Ideograph: A Language for Expressing and Manipulating Structured Data
computational interpretation	A Computational Interpretation of Girard’s Intuitionistic Proof-Nets
Curry-Howard correspondence	A Computational Interpretation of Girard’s Intuitionistic Proof-Nets
D
data representation	Ideograph: A Language for Expressing and Manipulating Structured Data
double push out approach	PBPO+ Graph Rewriting in Context
double pushout approach	Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
G
generative power	Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
graph grammar	Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
graph rewriting	A PBPO+ Graph Rewriting Tutorial PBPO+ Graph Rewriting in Context
graph transformations	Formalization and analysis of BPMN using graph transformation systems
greedy decomposition	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
I
intuitionistic linear logic	A Computational Interpretation of Girard’s Intuitionistic Proof-Nets
K
Kleene star	Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
L
Lambek calculus	Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
linear logic	Ideograph: A Language for Expressing and Manipulating Structured Data
M
model checking	Formalization and analysis of BPMN using graph transformation systems
monadic embedding	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
multistep reduction	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
O
oudenadic embedding	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
P
PBPO+	A PBPO+ Graph Rewriting Tutorial
permutation equivalence	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
process modeling	Formalization and analysis of BPMN using graph transformation systems
proof nets	Ideograph: A Language for Expressing and Manipulating Structured Data A Computational Interpretation of Girard’s Intuitionistic Proof-Nets
T
topological multisorting	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
trace graph	Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
tutorial	A PBPO+ Graph Rewriting Tutorial

Disclaimer | Powered by EasyChair Smart Program