FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

A
alpha-equivalence	Fixed-Point Constraints for Nominal Equational Unification
Anti-unification	Term-Graph Anti-Unification Higher-Order Equational Pattern Anti-Unification
automation	Completion for Logically Constrained Rewriting
B
B combinator	On repetitive right application of B-terms
Bimonad	Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories
Böhm trees	Strict Ideal Completions of the Lambda Calculus
C
Categorical Quantum Mechanics	A diagrammatic axiomatisation of fermionic quantum circuits
category theory	Call-by-name Gradual Type Theory
Coalgebra Modality	Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories
coherence	Coherence of Gray categories via rewriting
coinduction	Term rewriting characterisation of LOGSPACE for finite and infinite data
Combinatorics	Counting Environments and Closures
combinatory logic	On repetitive right application of B-terms
completeness	Completeness of Tree Automata Completion
completion	Completion for Logically Constrained Rewriting
Complexity	Counting Environments and Closures
complexity classes	Unique perfect matchings and proof nets
conditional term rewriting	Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
confluence	Decreasing diagrams with two labels are complete for confluence of countable systems Strict Ideal Completions of the Lambda Calculus Confluence of Prefix-Constrained Rewrite Systems
constrained rewriting	Completion for Logically Constrained Rewriting
contractibility	Proof nets for bi-intuitionistic linear logic
Coq	Cumulative Inductive Types in Coq
correctness criteria	Unique perfect matchings and proof nets
critical pair	Confluence of Prefix-Constrained Rewrite Systems
cubical sets	Internal Universes in Models of Homotopy Type Theory
Cyclic term-graps	Term-Graph Anti-Unification
D
decreasing diagrams	Decreasing diagrams with two labels are complete for confluence of countable systems
denotational semantics	Call-by-name Gradual Type Theory The clocks they are adjunctions. Denotational semantics for Clocked Type Theory
dependent type theory	Internal Universes in Models of Homotopy Type Theory
E
Eilenberg-Moore Category	Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories
Equational theories	Fixed-Point Constraints for Nominal Equational Unification Higher-Order Equational Pattern Anti-Unification
F
fermionic quantum computing	A diagrammatic axiomatisation of fermionic quantum circuits
fixed point equations	Fixed-Point Constraints for Nominal Equational Unification
functional programming	Nominal Unification with Atom and Context Variables Counting Environments and Closures
G
Gradual Typing	Call-by-name Gradual Type Theory
graph algorithms	Unique perfect matchings and proof nets
Gray category	Coherence of Gray categories via rewriting
Guarded Recursion	The clocks they are adjunctions. Denotational semantics for Clocked Type Theory
H
higher inductive types	A Syntax for Higher Inductive-Inductive Types
higher-order recursion schemes	Homogeneity without Loss of Generality
higher-order unification	Nominal Unification with Atom and Context Variables
homogeneous types	Homogeneity without Loss of Generality
homotopy type theory	A Syntax for Higher Inductive-Inductive Types Internal Universes in Models of Homotopy Type Theory
Hopf Monad	Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories
I
implicit complexity	Term rewriting characterisation of LOGSPACE for finite and infinite data
Indexed types	Index-Stratified Types
inductive types	Cumulative Inductive Types in Coq
inductive-inductive types	A Syntax for Higher Inductive-Inductive Types
infinitary rewriting	Strict Ideal Completions of the Lambda Calculus Term rewriting characterisation of LOGSPACE for finite and infinite data
innermost conditional narrowing	Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
interactive tool	ProTeM: A Proof Term Manipulator
internal language	Internal Universes in Models of Homotopy Type Theory
intuitionistic linear logic	Proof nets for bi-intuitionistic linear logic
L
lambda calculus	Strict Ideal Completions of the Lambda Calculus On repetitive right application of B-terms Nominal Unification with Atom and Context Variables
lambda-calculus	Counting Environments and Closures Homogeneity without Loss of Generality
Least general generalization	Term-Graph Anti-Unification
Linear Category	Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories
linear logic	Proof nets for bi-intuitionistic linear logic Unique perfect matchings and proof nets
Logical relations	A Syntax for Higher Inductive-Inductive Types Index-Stratified Types
LOGSPACE	Term rewriting characterisation of LOGSPACE for finite and infinite data
M
mathematical analysis	Counting Environments and Closures
meaningless terms	Strict Ideal Completions of the Lambda Calculus
Mixed Distributive Law	Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories
modalities	Internal Universes in Models of Homotopy Type Theory
monoidal categories	A diagrammatic axiomatisation of fermionic quantum circuits
Monoidal Coalgebra Modality	Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories
N
nominal terms	Fixed-Point Constraints for Nominal Equational Unification
nominal unification	Fixed-Point Constraints for Nominal Equational Unification Nominal Unification with Atom and Context Variables
normalisation	Strict Ideal Completions of the Lambda Calculus
O
over-approximation	Completeness of Tree Automata Completion
P
polygraph	Coherence of Gray categories via rewriting
prefix-constrained term rewriting	Confluence of Prefix-Constrained Rewrite Systems
program transformation	Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
program transformations	Nominal Unification with Atom and Context Variables
proof assistants	Cumulative Inductive Types in Coq
proof nets	Proof nets for bi-intuitionistic linear logic
proof terms	ProTeM: A Proof Term Manipulator
PSPACE	A Unifying Framework for Type Inhabitation
Q
quantum computing	A diagrammatic axiomatisation of fermionic quantum circuits
quotient inductive types	A Syntax for Higher Inductive-Inductive Types
R
Recursive types	Index-Stratified Types
regular tree grammar	Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
regularity preservation	Completeness of Tree Automata Completion
rewriting	A Unifying Framework for Type Inhabitation Coherence of Gray categories via rewriting
S
safe schemes	Homogeneity without Loss of Generality
simple types	A Unifying Framework for Type Inhabitation
Simply typed lambda calculus	Higher-Order Equational Pattern Anti-Unification
string diagrams	A diagrammatic axiomatisation of fermionic quantum circuits
subtyping	Cumulative Inductive Types in Coq
Systems of recursion equations	Term-Graph Anti-Unification
T
term rewriting	ProTeM: A Proof Term Manipulator Term rewriting characterisation of LOGSPACE for finite and infinite data
term rewriting systems	Completeness of Tree Automata Completion
theorem proving	Completion for Logically Constrained Rewriting
tree automata	Completeness of Tree Automata Completion
tree automata completion	Completeness of Tree Automata Completion
Type Inhabitation	A Unifying Framework for Type Inhabitation
Type theory	Call-by-name Gradual Type Theory The clocks they are adjunctions. Denotational semantics for Clocked Type Theory
U
univalent foundations	Internal Universes in Models of Homotopy Type Theory
universes	Cumulative Inductive Types in Coq Internal Universes in Models of Homotopy Type Theory
W
weak diamond property	Decreasing diagrams with two labels are complete for confluence of countable systems
Z
zw calculus	A diagrammatic axiomatisation of fermionic quantum circuits
zx calculus	A diagrammatic axiomatisation of fermionic quantum circuits

Disclaimer | Powered by EasyChair Smart Program