Quinn Pham, Danila Seliayeu, et al.
CASCON 2024
This paper presents a comparatively general method for specifying a 'data constraint' on a parameterized data type (i.e., specifying just which category of algebras it is supposed to be defined or correct on), and shows that there is a simple canonical form for such constraint specifications. We also show how such constraints may be employed to give 'loose' specifications of data types. © 1987.
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024
Preeti Malakar, Thomas George, et al.
SC 2012
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
György E. Révész
Theoretical Computer Science