CfPBoK
by
Vadim Zaytsev
sle2024/paper10
SLE 2024
paper:
Type Checking with Rewriting Rules
Dimi Racordon
DOI:
10.1145/3687997.3695640
T1B: Static Semantics
The paper casts type checking (for type-class style constraints) as a rewriting-based process over types/constraints.
T5D: Formal Methods
Rewriting rules provide a formal, analysable framework for specifying and reasoning about the type system.
T3A: Meta-languages
The approach effectively defines a meta-level rule language for expressing typing and constraint resolution.
The page is maintained by
Dr. Vadim Zaytsev
a.k.a. @
grammarware
. Last updated: June 2026.