FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

A
automation	On Confluence of Parallel-Innermost Term Rewriting
C
Commutation	A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
Competition	Confluence Competition
Completeness	Uniform Completeness
Conditional Term Rewriting Systems	A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
confluence	Proving Confluence with CONFident A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems On local confluence of conditional rewrite systems Development Closed Critical Pairs: Towards a Formalized Proof On Confluence of Parallel-Innermost Term Rewriting Seven Confluence Criteria for Solving COPS #20 Confluence Competition
COPS#20	Seven Confluence Criteria for Solving COPS #20
criteria	Seven Confluence Criteria for Solving COPS #20
Critical Pair	Confluence by Higher-Order Multi--One Critical pairs with an application to the Functional Machine Calculus
Critical Pairs	A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
CS-TRSs	Proving Confluence with CONFident
CTRSs	Proving Confluence with CONFident
D
development closed critical pairs	Development Closed Critical Pairs: Towards a Formalized Proof
E
equivalence	Formalized Signature Extension Results for Equivalence
F
first-order theory of rewriting	Formalized Signature Extension Results for Equivalence
formalization	Formalized Signature Extension Results for Equivalence
Functional Machine Calculus	Confluence by Higher-Order Multi--One Critical pairs with an application to the Functional Machine Calculus
Functional programming	Checking Confluence of Rewrite Rules in Haskell
H
Haskell	Checking Confluence of Rewrite Rules in Haskell
Higher-Order Pattern Rewrite System	Confluence by Higher-Order Multi--One Critical pairs with an application to the Functional Machine Calculus
Higher-order rewriting	Checking Confluence of Rewrite Rules in Haskell
I
infeasibility	Proving Confluence with CONFident
M
Multi--One Peak	Confluence by Higher-Order Multi--One Critical pairs with an application to the Functional Machine Calculus
N
Normalisation	Uniform Completeness
O
Ordered Local Confluence	Uniform Completeness
P
parallel-innermost rewriting	On Confluence of Parallel-Innermost Term Rewriting
program analysis	On local confluence of conditional rewrite systems
R
Random Descent	Uniform Completeness
Reduction Measure	Uniform Completeness
reduction-based systems	On local confluence of conditional rewrite systems
S
system description	Proving Confluence with CONFident
T
term rewriting	Development Closed Critical Pairs: Towards a Formalized Proof
Tool	Checking Confluence of Rewrite Rules in Haskell
tools	Confluence Competition
TRSs	Proving Confluence with CONFident

Disclaimer | Powered by EasyChair Smart Program