TERMGRAPH 2014 VSL PROCEEDINGS: KEYWORD INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: A C D E F G H I L M N P R T U

A
ACC	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
Algebraic structure	Fixed Point Theory for Consistent Rewriting in Logic of Action with Reverse (PDF, talk)
C
Compilation	Needed Computations Shortcutting Needed Steps (PDF, talk) An Implementation Model for Interaction Nets (PDF, talk)
complexity analysis	Proving Termination of Unfolding Graph Rewriting for General Safe Recursion (PDF, talk)
Connectedness	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
context-free grammars	Nested Term Graphs (PDF, talk)
cyclic lambda-terms	Nested Term Graphs (PDF, talk)
D
Data structures	An Implementation Model for Interaction Nets (PDF, talk)
Diffnets	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
E
Empire	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
F
Fixed point theory	Fixed Point Theory for Consistent Rewriting in Logic of Action with Reverse (PDF, talk)
G
General safe recursion	Proving Termination of Unfolding Graph Rewriting for General Safe Recursion (PDF, talk)
graph rewriting	Needed Computations Shortcutting Needed Steps (PDF, talk)
H
higher-order rewrite systems	Nested Term Graphs (PDF, talk)
higher-order term graphs	Nested Term Graphs (PDF, talk)
I
Infinite graph rewriting	Proving Termination of Unfolding Graph Rewriting for General Safe Recursion (PDF, talk)
Interaction nets	An Implementation Model for Interaction Nets (PDF, talk)
L
linear logic	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
M
MELL	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
N
Needed step	Needed Computations Shortcutting Needed Steps (PDF, talk)
normalization	Needed Computations Shortcutting Needed Steps (PDF, talk)
P
Polynomial runtime complexity	Proving Termination of Unfolding Graph Rewriting for General Safe Recursion (PDF, talk)
proof-nets	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
R
relational semantics	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
Rewriting in action logic	Fixed Point Theory for Consistent Rewriting in Logic of Action with Reverse (PDF, talk)
T
Taylor expansion	Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (PDF, talk)
Termination proof	Proving Termination of Unfolding Graph Rewriting for General Safe Recursion (PDF, talk)
U
Unfolding graph rewriting	Proving Termination of Unfolding Graph Rewriting for General Safe Recursion (PDF, talk)