Automatic Synthesis of Typed Lambda-Programs on Term Algebras

@article{Bhm1985AutomaticSO,
  title={Automatic Synthesis of Typed Lambda-Programs on Term Algebras},
  author={Corrado B{\"o}hm and Alessandro Berarducci},
  journal={Theor. Comput. Sci.},
  year={1985},
  volume={39},
  pages={135-154}
}
The notion of iteratively defined functions from and to heterogeneous term algebras is introduced as the solution of a finite set of equations of a special shape. Such a notion has remarkable consequences: (1) Choosing the second-order typed lambdacalculus (A for short) as a programming language enables one to represent algebra elements and iterative functions by automatic uniform synthesis paradigms, using neither conditional nor recursive constructs. (2) A completeness theorem for A-terms… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS