169 search results - page 28 / 34 » A type system for well-founded recursion |
134
Voted
NPC
2004
Springer
15 years 10 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...
136
Voted
EMMCVPR
2001
Springer
15 years 9 months 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 ...
116
Voted
APAL
2005
15 years 4 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...
157
click to vote
HASKELL
2008
ACM
15 years 6 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...
164
click to vote
ICFP
2010
ACM
15 years 5 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...