FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

A
Agda	Experimenting with graded monads: certified grading-based program transformations
C
call-by-push-value	A resource modality for RAII
category	Heaps denote finitely partitioned trees
compiler verification	A more precise, more correct stack and register model for CompCert
concurrency	Denotational Event structure for relaxed memory
Coq	Towards a library of formalised undecidable problems in Coq: The undecidability of intuitionistic linear logic
D
denotational semantics	Heaps denote finitely partitioned trees Denotational Event structure for relaxed memory
destructors	A resource modality for RAII
E
equational theory	A graph-rewriting perspective of the beta-law
Event structures	Denotational Event structure for relaxed memory
exceptions	A resource modality for RAII
F
finitely partitioned trees	Heaps denote finitely partitioned trees
functorial spans	Asynchronous games fifteen years later
G
Game semantics	Asynchronous games fifteen years later
graded monads	Experimenting with graded monads: certified grading-based program transformations
graph rewriting	A graph-rewriting perspective of the beta-law
H
heaps	Heaps denote finitely partitioned trees
I
intermediate representations	A more precise, more correct stack and register model for CompCert
intuitionistic linear logic	Towards a library of formalised undecidable problems in Coq: The undecidability of intuitionistic linear logic
L
linear logic	A resource modality for RAII
M
Minsky machines	Towards a library of formalised undecidable problems in Coq: The undecidability of intuitionistic linear logic
O
operational semantics	A more precise, more correct stack and register model for CompCert
P
Post Correspondence Problem	Towards a library of formalised undecidable problems in Coq: The undecidability of intuitionistic linear logic
program transformations	Experimenting with graded monads: certified grading-based program transformations
Q
quantified effects	Experimenting with graded monads: certified grading-based program transformations
R
RAII	A resource modality for RAII
Reduction	Towards a library of formalised undecidable problems in Coq: The undecidability of intuitionistic linear logic
references	Heaps denote finitely partitioned trees
resource management	A resource modality for RAII
resource modality	A resource modality for RAII
S
simulation	A graph-rewriting perspective of the beta-law
symmetric monoidal closed bicategories	Asynchronous games fifteen years later
T
type-and-effect-systems	Experimenting with graded monads: certified grading-based program transformations
U
undecidability	Towards a library of formalised undecidable problems in Coq: The undecidability of intuitionistic linear logic
W
weak memory	Denotational Event structure for relaxed memory

Disclaimer | Powered by EasyChair Smart Program