Development Separation in Lambda-Calculus

Authors:
Hongwei Xi
Affiliations:
Computer Science Department, Boston University, Boston, Massachusetts, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 2
Cited 1

Parallel reductions in &lgr;-calculus

Information and Computation
Evaluation Under Lambda Abstraction

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education

A note on subject reduction in (→,∃)-Curry with respect to complete developments

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a proof technique in @l-calculus that can facilitate inductive reasoning on @l-terms by separating certain @b-developments from other @b-reductions. We give proofs based on this technique for several fundamental theorems in @l-calculus such as the Church-Rosser theorem, the standardization theorem, the conservation theorem and the normalization theorem. The appealing features of these proofs lie in their inductive styles and perspicuities.