[PDF] Top 20 PRL RR 10 pdf

... Many programming languages use pattern matching in a many-sorted term algebra (such as those in the ML family [6]) or an order-sorted term algebra (such as those in the OBJ family [5]) for function argument-passing. ... See full document

... We have overviewed a formal design for interfacing a logical query language with complex objects to a relational database. Our system is an improvement on previous systems in that it provides database storage for objects ... See full document

... An important structural property of many logic programming systems is the fact that they factorize into a constraint system and a relational facility. Colmerauer’s Prolog II [10] is an early language design making ... See full document

... rule Eq appl2. In our view, the compatibility of Axiom C with system F is one thing to be noted in order to understand parametricity. Moreover, all models that yield the dinatural interpretation of terms in [BFSS90] ... See full document

... multiplicands and summands (see [Lyo76], [BRV89] and [SBV91]). These multipliers are interfaced with an arbitrary-precision arithmetic package BigNum (see [SVH89]) so that any program based on that software takes ... See full document

... Our approach essentially relies on the well known Monte Carlo method, combined with appropriate importance sampling schemes and a new error reduction technique, that we call quadratic resampling. We have shown that the ... See full document

... Many modern programming languages allow specifying arguments of functions and procedures by symbolic keywords as well as using the traditional and natural numeric positions [14, 10, 3]. Symbolic keywords are ... See full document

... One unique feature of Rockit is that it usually infers the desired constraint very quickly by using gravity fields to filter out unlikely possibilities. Users do not need to continually answer questions [20], produce ... See full document

... The work of Emele and Zajac on typed unification grammars [10] is actually quite close to what we report here. Their work is an elaboration of [1], with the assumption that features are partial. Their main ... See full document

... The high computational requirements of motion planning are mostly due to the need to perform repeated collision checking between the robot and the obstacles (Metivier and Urbschat 1990 [28]). Detecting the collision of a ... See full document

... The author thanks the many developers and pioneers in the logic programming community. In particular, the following friends and colleagues helped tremendously by recollecting past events and providing critical comments: ... See full document

... Table 7: Accuracy of the FSG method measured against the zero-strike average-rate option. Time Steps were set to 1, 2, and 3 days for 3, 6, and 12 months maturities respectively. Table 8 shows that the geometric average ... See full document

... In order to speed-up the Monte Carlo simulation of conditional probabilities, we developed an original variance reduction technique called Quadratic Resampling. Quadratic Resampling was originally presented in Barraquand ... See full document

... PAMs are primarily aimed at computationally intensive problems, where wide, application specific data-paths can offer great speedups over software [10]. By contrast, in measurement applications we rely on the ... See full document

... Modern radio techniques, including radar and spread-spectrum communications, make use of finite sequences of bits exhibiting various correlation properties (e.g. [5], [2] chapters 10 and 12, [1]). The correlation ... See full document

... Call by pattern matching is one of the main features of the ML language [4, 10] and was inherited from HOPE [2]. It may be viewed as a generalization of the “case” statement of imperative languages. In ML, one can ... See full document

... ::::::::::::::: 10 DivideDigit(q,n,nl,d), ::::::::::: 10 DoesDigitFitInWord(d), ::::::::: 17 GetDigit(n), :::::::::::::::::::: 18 Init(), ::::::::::::::::::::::::::: 5 IsDigitNormalized(d), ::::::::::: 12 ... See full document

... page at 300 dpi. Then, input control points may be defined on twice as large an area, to permit clipped curves. We must also choose a maximum zoom factor: a reasonable value is 8. Since the rounded chords must have odd ... See full document

... We now show that the simply-typed -calculus provides a natural notation for proofs in natural deduction, and that -conversion corresponds naturally to proof normalization. The trick is to annotate inference rules with ... See full document

... 25 MHz, computing one bit of the transformed image on each cycle, for a total of 10 ms per image. Our best software solution for that problem is at least two orders of magnitude slower. This design was implemented ... See full document