A syntactical proof of the operational equivalence of two \(\lambda\)-terms

DOI10.1016/S0304-3975(97)00004-2zbMath0896.03015arXiv0905.0769MaRDI QIDQ1390880

Karim Nour, René David

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.0769

zbMATH Keywords

operational equivalence of lambda-terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (1)

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Storage operators and directed lambda-calculus

This page was built for publication: A syntactical proof of the operational equivalence of two \(\lambda\)-terms