DocumentCode
2893758
Title
An abstract standardisation theorem
Author
Gonthier, Georges ; Lévy, Jean-Jacques ; Melliès, Paul-André
Author_Institution
INRIA, Le Chesnay, France
fYear
1992
fDate
22-25 Jun 1992
Firstpage
72
Lastpage
81
Abstract
An axiomatic version of the standardization theorem that shows the necessary basic properties between nesting of redexes and residuals is presented. This axiomatic approach provides a better understanding of standardization, and makes it applicable in other settings, such as directed acyclic graphs (dags) or interaction networks. conflicts between redexes are also treated. The axioms include stability in the sense given by G. Berry (Ph.D. thesis, Univ. of Paris, 1979), proving it to be an intrinsic notion of deterministic calculi
Keywords
formal logic; graph theory; axiomatic; deterministic calculi; directed acyclic graphs; interaction networks; redexes; residuals; standardization theorem; Arithmetic; Calculus; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1992. LICS '92., Proceedings of the Seventh Annual IEEE Symposium on
Conference_Location
Santa Cruz, CA
Print_ISBN
0-8186-2735-2
Type
conf
DOI
10.1109/LICS.1992.185521
Filename
185521
Link To Document