论文信息 - Solving Equations in Lambda-Calculus

Solving Equations in Lambda-Calculus

Abstract Part 1 reviews principal solvable and unsolvable equations and equation systems encountered in λ-calculus and Combinatory Logic. Particular emphasis is given to the solvability of discriminability, separability and X-separability problems. All these problems are special cases of (and are improved by) the predicate “F is X-weakly separable”, whose decidability is proved in part 2. The more general X-weak separability problem still remains open.

[1] Corrado Böhm,et al. Surjectivity for Finite Sets of Combinators by Weak Reduction , 1987, CSL.

[2] Mariangiola Dezani-Ciancaglini,et al. Combinatorial Problems, Combinator Equations and Normal Forms , 1974, ICALP.

[3] Enrico Tronci,et al. X-Separability and Left-Invertibility in lambda-calculus , 1987, LICS.

[4] Mariangiola Dezani-Ciancaglini,et al. Characterization of Normal Forms Possessing Inverse in the lambda-beta-eta-Calculus , 1976, Theor. Comput. Sci..

[5] Corrado Böhm,et al. Functional Programming and Combinatory Algebras , 1988, International Symposium on Mathematical Foundations of Computer Science.

[6] Mariangiola Dezani-Ciancaglini,et al. (Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus , 1978, ICALP.

[7] Mariangiola Dezani-Ciancaglini,et al. A Discrimination Algorithm Inside lambda-beta-Calculus , 1979, Theor. Comput. Sci..

[8] Corrado Böhm,et al. Characterizing X-separability and one-side invertibility in lambda - beta - Omega -calculus , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.