169 search results - page 28 / 34 » A type system for well-founded recursion |
NPC
2004
Springer
14 years 1 months ago
2004
Springer
In conventional DHTs, each node is assigned an exclusive slice of identifier space. Simple it is, such arrangement may be rough. In this paper we propose a generic component struc...
EMMCVPR
2001
Springer
14 years 4 days ago
2001
Springer
In a previous paper we described a system which recursively recovers a super-resolved three dimensional surface model from a set of images of the surface. In that paper we assumed ...
APAL
2005
13 years 7 months ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
HASKELL
2008
ACM
13 years 8 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...