PT Journal AU Tronci, E TI Defining Data Structures via Böhm-Out SO J. Funct. Program. PY 1995 BP 51 EP 64 VL 5 IS 1 DI 10.1017/S0956796800001234 AB We show that any recursively enumerable subset of a data structure can be regarded as the solution set to a B??hm-out problem. ER