Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Arbib, M.A. and Manes, E.G., The pattern-of-call expansion is the canonical fixpoint for recursive definitions, J.Assoc.Comput.Mach. 29, 1982, pp.577–602
2. Arnold, A. and Nivat, M., Metric interpretations of infinite trees and semantics in nondeterministic recursive programs, Theor.Comp.Sci. 11, 1980, pp.181–205
3. Barendregt,H.P., The lambda calculus, North Holland, 1981
4. Böhm, C. and Berarducci, A., Automatic Synthesis of Typed A-Programs on Term Algebras, Theoretical Computer Science, 39 (1985), pp 135–154
5. Berarducci, A., Programmazione funzionale e rappresentabilità in alcuni sistemi di logica combinatoria, Tesi di Laurea in matematica, Roma, 1983, 105 pp.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献