64 search results - page 12 / 13 » Recursive Analysis Characterized as a Class of Real Recursiv... |
TLDI
2005
ACM
13 years 11 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient us...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
TASE
2008
IEEE
13 years 6 months ago
2008
IEEE
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
CIE
2010
Springer
13 years 10 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...