output
19942026
most citedLOFAR: The LOw-Frequency ARray

2.7k citations

Showing 2000Show all

17 papers · 1 filter

math.PR2000

A signal-recovery system: asymptotic properties and construction of an infinite volume limit

Jacob van den Berg, Balint Toth

We consider a linear sequence of `nodes', each of which can be in state 0 (`off') or 1 (`on'). Signals from outside are sent to the rightmost node and travel instantaneously as far…

quant-ph2000★ 69 cited

Quantum Algorithmic Entropy

Peter Gacs

We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexi…

cs.LO2000

Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

Jan-Georg Smaus, Francois Fages, Pierre Deransart

We consider a general prescriptive type system with parametric polymorphism and subtyping for logic programs. The property of subject reduction expresses the consistency of the typ…

cond-mat.stat-mech2000

Tradable Schemes

Jiri Hoogland, Dimitri Neumann

In this article we present a new approach to the numerical valuation of derivative securities. The method is based on our previous work where we formulated the theory of pricing in…

cs.PL2000★ 6 cited

Compiling Language Definitions: The ASF+SDF Compiler

M. G. J. van den Brand, J. Heering, P. Klint +1

The ASF+SDF Meta-Environment is an interactive language development environment whose main application areas are definition of domain-specific languages, generation of program anal…

cs.LO2000

Verifying Termination and Error-Freedom of Logic Programs with block Declarations

Jan-Georg Smaus, Patricia M. Hill, Andy King

We present verification methods for logic programs with delay declarations. The verified properties are termination and freedom from errors related to built-ins. Concerning termina…