Logic in Computer Science (LICS 1990)

Paper: Completeness for typed lazy inequalities (at LICS 1990)

Authors: Cosmadakis, S.S. Meyer, A.R. Riecke, J.G.

Abstract

Familiar βη-equational reasoning on λ-terms is unsound for proving observational congruences when termination of the standard lazy interpreter is taken into account. A complete logic, based on sequents, for proving termination-observational congruences between simply-typed terms without constants is developed. It is shown that the theory, like that of βη-reasoning in the ordinary types λ-calculus, is decidable. The authors examined the termination behavior of the functional language PCF under the standard interpreters

BibTeX

  @InProceedings{CosmadakisMeyerRiec-Completenessfortype,
    author = 	 {Cosmadakis, S.S. and Meyer, A.R. and Riecke, J.G.},
    title = 	 {Completeness for typed lazy inequalities},
    booktitle =  {Proceedings of the Fifth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1990},
    year =	 1990,
    editor =	 {John Mitchell},
    month =	 {June}, 
    pages =      {312--320},
    location =   {Philadelphia, PA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }