A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report)

Jon G. Riecke. A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report). In Mike Paterson, editor, Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, July 16-20, 1990, Proceedings. Volume 443 of Lecture Notes in Computer Science, pages 20-31, Springer, 1990.

@inproceedings{Riecke90,
  title = {A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report)},
  author = {Jon G. Riecke},
  year = {1990},
  tags = {completeness},
  researchr = {https://researchr.org/publication/Riecke90},
  cites = {0},
  citedby = {0},
  pages = {20-31},
  booktitle = {Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, July 16-20, 1990, Proceedings},
  editor = {Mike Paterson},
  volume = {443},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-52826-1},
}