𝐶^{𝑚} Interpolation for Finite Data

Keyword(s):  
1982 ◽  
Vol 5 (2) ◽  
pp. 143-170
Author(s):  
Jan A. Bergstra ◽  
John-Jules Ch. Meyer

In [5] it has been proved that by using hidden functions the number of equations needed to specify a finite data type is bounded by numbers depending only on the signature of that data type. In the special case of a finite minimal unoid, however, it seems to be relevant to ask whether or not a specification can also be made by a bounded number of equations using only unary hidden functions. In this paper we prove that this can be done.


1994 ◽  
Vol 30 (1) ◽  
pp. 161-174 ◽  
Author(s):  
K.R. Srinivas ◽  
V.U. Reddy
Keyword(s):  

2007 ◽  
Author(s):  
Matthew A. Kupinski ◽  
Eric Clarkson ◽  
Jacob Y. Hesterman

Sign in / Sign up

Export Citation Format

Share Document