Logic in Computer Science (LICS 1992)

Paper: An abstract standardisation theorem (at LICS 1992)

Authors: Gonthier, G. Levy, J.-J. Mellies, P.-A.

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

BibTeX

  @InProceedings{GonthierLevyMellies-Anabstractstandardi,
    author = 	 {Gonthier, G. and Levy, J.-J. and Mellies, P.-A.},
    title = 	 {An abstract standardisation theorem},
    booktitle =  {Proceedings of the Seventh Annual IEEE Symp. on Logic in Computer Science, {LICS} 1992},
    year =	 1992,
    editor =	 {Andre Scedrov},
    month =	 {June}, 
    pages =      {72--81},
    location =   {Santa Cruz, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }