39 search results - page 6 / 8 » Polymorphic Type Inference for the Relational Algebra |
GI
1997
Springer
13 years 10 months ago
1997
Springer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...
FUIN
2006
13 years 5 months ago
2006
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...
ICALP
2007
Springer
13 years 9 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
POPL
2004
ACM
14 years 6 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
FPCA
1989
13 years 9 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...