Sciweavers

3319 search results - page 162 / 664
» Type Theoretical Databases
Sort
View
90
Voted
TLCA
2007
Springer
15 years 4 months ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
TLCA
2005
Springer
15 years 3 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
FOCS
2003
IEEE
15 years 3 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
FOCS
1998
IEEE
15 years 2 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
DATASCIENCE
2006
110views more  DATASCIENCE 2006»
14 years 10 months ago
Towards development of a high quality public domain global roads database
There is clear demand for a global spatial public domain roads data set with improved geographic and temporal coverage, consistent coding of road types, and clear documentation of...
Andrew Nelson 0002, Alexander de Sherbinin, France...