Church-Rosser theorem for a rewriting system on categorical combinators

Authors:
Hirofumi Yokouchi
Affiliations:
IBM Research, Tokyo, Japan
Venue:
Theoretical Computer Science
Year:
1989

Citing 0
Cited 3

On laziness and optimality in lambda interpreters: tools for specification and analysis

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence properties of weak and strong calculi of explicit substitutions

Journal of the ACM (JACM)
Sequent combinators: a Hilbert system for the lambda calculus

Mathematical Structures in Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract