154 search results - page 3 / 31 » Cobham recursive set functions |
CORR
2008
Springer
13 years 3 months ago
2008
Springer
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...
PG
2003
IEEE
13 years 10 months ago
2003
IEEE
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
ESOP
2003
Springer
13 years 10 months ago
2003
Springer
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
JLP
2000
13 years 5 months ago
2000
Generating query-answering plans for data integration systems requires to translate a user query, formulated in terms of a mediated schema, to a query that uses relations that are...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...