A Discrimination Algorithm Inside lambda-beta-Calculus

@article{Bhm1979ADA,
  title={A Discrimination Algorithm Inside lambda-beta-Calculus},
  author={Corrado B{\"o}hm and Mariangiola Dezani-Ciancaglini and P. Peretti and Simona Ronchi Della Rocca},
  journal={Theor. Comput. Sci.},
  year={1979},
  volume={8},
  pages={265-292}
}
Abstract A finite set { F 1 ,…, F n } of λ-terms is said to be discriminable if, given n arbitrary λ-terms X 1 ,…, X n , there exists a λ-term Δ such that: ΔF i ⩾ X i for 1 ⩽ i ⩽ n . In the present paper each finite set of normal combinators which are pairwise non α-η-convertible is proved to be discriminable. Moreover a discrimination algorithm is given. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS