HOR 2014 WORKSHOP PROCEEDINGS: KEYWORD INDEX

Shortcuts: (A C D E F G L O P R T U

(
(weak) orthogonality	The dynamic pattern calculus as a higher-order pattern rewriting system (PDF, talk)
A
Abstract Machines	Distilling Abstract Machines (Extended Abstract) (PDF, talk)
C
compiler construction	Experience with Higher Order Rewriting from the Compiler Teaching Trenches (PDF, talk)
critical peak	Feebly not weakly (PDF, talk)
critically trivial	Feebly not weakly (PDF, talk)
D
dynamic pattern calculus	The dynamic pattern calculus as a higher-order pattern rewriting system (PDF, talk)
E
embedding	The dynamic pattern calculus as a higher-order pattern rewriting system (PDF, talk)
Explicit Substitutions	Distilling Abstract Machines (Extended Abstract) (PDF, talk)
F
feeble orthogonality	Feebly not weakly (PDF, talk)
formalisms	Experience with Higher Order Rewriting from the Compiler Teaching Trenches (PDF, talk)
G
geometric	Feebly not weakly (PDF, talk)
L
linear	Feebly not weakly (PDF, talk)
linear logic	Distilling Abstract Machines (Extended Abstract) (PDF, talk)
O
orthogonalisation	Feebly not weakly (PDF, talk)
P
pattern	Feebly not weakly (PDF, talk)
R
Rewriting	Distilling Abstract Machines (Extended Abstract) (PDF, talk)
T
teaching	Experience with Higher Order Rewriting from the Compiler Teaching Trenches (PDF, talk)
transfer of meta-theory	The dynamic pattern calculus as a higher-order pattern rewriting system (PDF, talk)
U
Unification	Feebly not weakly (PDF, talk)