TY - JOUR AU - Tronci, Enrico PY - 1995 DA - 1995// TI - Defining Data Structures via Böhm-Out JO - J. Funct. Program. SP - 51 EP - 64 VL - 5 IS - 1 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. UR - https://doi.org/10.1017/S0956796800001234 DO - 10.1017/S0956796800001234 N1 - exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=57), last updated on Sat, 24 Nov 2012 14:33:44 +0100 ID - Tronci1995 ER -