8 search results - page 2 / 2 » Strictness Logic and Polymorphic Invariance |
LOPSTR
2005
Springer
13 years 10 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...