@inbook{2944498b0c3a43e297e8bac221fb56b3,

title = "Relative normalization in Deterministic Residual Structures",

abstract = "This paper generalizes the Huet and L{\'e}vy theory of normalization by neededness to an abstract setting. We define Stable Deterministic Residual Structures (SDRS) and Deterministic Family Structures (DFS) by axiomatizing some properties of the residual relation and the family relation on redexes in an Abstract Rewriting System. We present two proofs of the Relative Normalization Theorem, one for SDRSs for regular stable sets, and another for DFSs for all stable sets of desirable {\textquoteleft}normal forms{\textquoteright}. We further prove the Relative Optimality Theorem for DFSs. We extend this result to deterministic Computation Structures which are deterministic Event Structures with an extra relation expressing self-essentiality.",

author = "Glauert, {John R. W.} and Zurab Khasidashvili",

year = "1996",

doi = "10.1007/3-540-61064-2_37",

language = "English",

volume = "1059",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "180--195",

editor = "H{\'e}l{\`e}ne Kirchner",

booktitle = "Trees in Algebra and Programming — CAAP '96",

address = "Germany",

note = "19th International Colloquium on Trees in Algebra and Programming (CAAP'96) ; Conference date: 01-01-1996",

}