No CrossRef data available.
Article contents
Defining data structures via Böhm-out1
Part of:
JFP Research Articles
Published online by Cambridge University Press: 07 November 2008
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
We show that any recursively enumerable subset of a data structure can be regarded as the solution set to a Böhm-out problem.
- Type
- Articles
- Information
- Copyright
- Copyright © Cambridge University Press 1995
References
Böhm, C. and Berarducci, A. (1985) Automatic synthesis of typed Λ-programs on term algebras. Theoretical Computer Science, 39, 135–154.Google Scholar
Burris, S. and Sankappanavar, H. P. (1981) A Course in Universal Algebra. Graduate Texts in Mathematics 78. Springer-Verlag.Google Scholar
Leivant, D. (1981) Reasoning about functional programs and complexity classes associated with type disciplines. 24th Ann. Symp. on Foundation of Computer Science, pp. 460–469.Google Scholar
Statman, R. (1989) On sets of solutions to combinator equations. Theoretical Computer Science, 66, 99–104.CrossRefGoogle Scholar
Tronci, E. (1991a) Equational programming in λ-calculus. Proc. LICS 91,AmsterdamJuly 15–18,IEEE Computer Society, pp. 191–202.Google Scholar
Tronci, E. (1991b) Equational programming in λ-calculus via SL-systems. PhD thesis, Department of Mathematics, Carnegie Mellon University.Google Scholar
You have
Access
Discussions
No Discussions have been published for this article.