FLOC 2022: FEDERATED LOGIC CONFERENCE 2022
TALK KEYWORD INDEX

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

Shortcuts: CDEFILMNPRSTX
C
coinductive type
Towards Corecursion Without Corecursion in Coq
confluence
Transforming Text to (and from) XML
constrained term rewriting
Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
Coq
Towards Corecursion Without Corecursion in Coq
A Machine-Checked Formalisation of Erlang Modules
corecursive function
Towards Corecursion Without Corecursion in Coq
cyclic proof
On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs
D
dependent types
Towards a Refactoring Tool for Dependently-Typed Programs (work in progress)
domain-specific languages
Refactoring Steps for P4 (work in progress)
E
Erlang
A Machine-Checked Formalisation of Erlang Modules
F
fixpoint
Towards Corecursion Without Corecursion in Coq
functional big-step semantics
A Machine-Checked Formalisation of Erlang Modules
I
imperative program
On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms
inductive theorem proving
Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
invertibility
Transforming Text to (and from) XML
L
lambda-calculus
Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language
lemma generation
Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
M
module system
A Machine-Checked Formalisation of Erlang Modules
N
natural semantics
A Machine-Checked Formalisation of Erlang Modules
P
P4 language
Refactoring Steps for P4 (work in progress)
pi-forall
Towards a Refactoring Tool for Dependently-Typed Programs (work in progress)
probabilistic programming
Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language
productivity
Transforming Text to (and from) XML
Program equivalence
Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language
program transformation
On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms
On Reducing Non-Occurrence of Specified Runtime Errors to All-Path Reachability Problems of Constrained Rewriting
Program Verification
On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms
R
refactoring
Towards a Refactoring Tool for Dependently-Typed Programs (work in progress)
Refactoring steps
Refactoring Steps for P4 (work in progress)
refactoring tools
Towards a Refactoring Tool for Dependently-Typed Programs (work in progress)
rewriting induction
On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs
Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
runtime-error verification
On Reducing Non-Occurrence of Specified Runtime Errors to All-Path Reachability Problems of Constrained Rewriting
S
semantics
Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language
Sequent Calculus
On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs
string-diagrammatic semantics
Transforming Text to (and from) XML
T
term rewriting
On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms
On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs
On Reducing Non-Occurrence of Specified Runtime Errors to All-Path Reachability Problems of Constrained Rewriting
Termination
Transforming Text to (and from) XML
transformation
Transforming Text to (and from) XML
X
XML
Transforming Text to (and from) XML