Results 1  10
of
128
Direct and Expressive Type Inference for the Rank 2 Fragment of System F
"... any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ..."
Abstract
 Add to MetaCart
any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public.
A direct algorithm for type inference in the rank2 fragment of the secondorder λcalculus
, 1993
"... We study the problem of type inference for a family of polymorphic type disciplines containing the power of CoreML. This family comprises all levels of the stratification of the secondorder lambdacalculus by "rank" of types. We show that typability is an undecidable problem at every ran ..."
Abstract

Cited by 82 (14 self)
 Add to MetaCart
rank k >= 3 of this stratification. While it was already known that typability is decidable at rank 2, no direct and easytoimplement algorithm was available. To design such an algorithm, we develop a new notion of reduction and show howto use it to reduce the problem of typability at rank 2
A more direct algorithm for type inference in the rank2 fragment of the secondorder λcalculus
, 2006
"... We present an algorithm for rank2 type inference in the secondorder λcalculus. Our algorithm differs from the wellknown algorithm of Kfoury and Wells in that it employs only a quadratically fewer type variables and inequalities. Our algorithm consists of a translation from a λterm to an instanc ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present an algorithm for rank2 type inference in the secondorder λcalculus. Our algorithm differs from the wellknown algorithm of Kfoury and Wells in that it employs only a quadratically fewer type variables and inequalities. Our algorithm consists of a translation from a λ
Rank 2 Type Systems and Recursive Definitions
, 1995
"... We demonstrate an equivalence between the rank 2 fragments of the polymorphic lambda calculus (System F) and the intersection type discipline: exactly the same terms are typable in each system. An immediate consequence is that typability in the rank 2 intersection system is DEXPTIMEcomplete. We int ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
We demonstrate an equivalence between the rank 2 fragments of the polymorphic lambda calculus (System F) and the intersection type discipline: exactly the same terms are typable in each system. An immediate consequence is that typability in the rank 2 intersection system is DEXPTIMEcomplete. We
Comparison of Fragmentation Schemes for Document Retrieval
 In Overview of TREC3
, 1995
"... Information systems usually rank whole documents to identify which are answers. However, it may in some circumstances be more appropriate to rank fragments to identify which documents are answers. We consider methods of fragmenting and examine the retrieval effectiveness achieved by each method. 1 I ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Information systems usually rank whole documents to identify which are answers. However, it may in some circumstances be more appropriate to rank fragments to identify which documents are answers. We consider methods of fragmenting and examine the retrieval effectiveness achieved by each method. 1
Quick shift and kernel methods for mode seeking
 In European Conference on Computer Vision, volume IV
, 2008
"... Abstract. We show that the complexity of the recently introduced medoidshift algorithm in clustering N points is O(N 2), with a small constant, if the underlying distance is Euclidean. This makes medoid shift considerably faster than mean shift, contrarily to what previously believed. We then explo ..."
Abstract

Cited by 94 (6 self)
 Add to MetaCart
Abstract. We show that the complexity of the recently introduced medoidshift algorithm in clustering N points is O(N 2), with a small constant, if the underlying distance is Euclidean. This makes medoid shift considerably faster than mean shift, contrarily to what previously believed. We
Adding Polymorphic Abstraction to ML (Detailed Abstract)
, 1994
"... The ML programming language restricts type polymorphism to occur only in the "letin" construct and requires every occurrence of a formal parameter of a function (a abstraction) to have the same type. Milner in 1978 [Mil78] refers to this restriction, which was adopted to help ML achieve ..."
Abstract
 Add to MetaCart
instances of a generic type. This extension is equivalent to the rank2 fragment of system F. We precisely characterize the additional program phrases (terms) that can be typed with this extension and we desc...
FragmentBased de Novo Ligand Design by Multiobjective Evolutionary Optimization
 J. Chem. Inf. Model. 2008
"... GANDI (Genetic Algorithmbased de Novo Design of Inhibitors) is a computational tool for automatic fragmentbased design of molecules within a protein binding site of known structure. A genetic algorithm and a tabu search act in concert to join predocked fragments with a usersupplied list of fragme ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
on cyclindependent kinase 2 (CDK2) using a library of about 14 000 fragments and the binding mode of a known oxindole inhibitor to bias the design. Top ranking GANDI molecules are involved in one to three hydrogen bonds with the backbone polar groups in the hinge region of CDK2, an interaction pattern
RECURSIVE FRAGMENTATION MODEL WITH QUARK SPIN. APPLICATION TO QUARK POLARIMETRY 1
"... An elementary recursive model accounting for the quark spin in the fragmentation of a quark into mesons is presented. The quark spin degree of freedom is represented by a twocomponents spinor. Spin one meson can be included. The model produces Collins effect and jet handedness. The influence of the ..."
Abstract
 Add to MetaCart
of the initial quark polarisation decays exponentially with the rank of the meson, at different rates for longitudinal and transverse polarisations. in2p300441764, version 1 6 Jan 2010 1
Behavior near the extinction time in selfsimilar fragmentations I: the stable case
, 2008
"... The stable fragmentation with index of selfsimilarity α ∈ [−1/2, 0) is derived by looking at the masses of the subtrees formed by discarding the parts of a (1 + α) −1 –stable continuum random tree below height t, for t ≥ 0. We give a detailed limiting description of the distribution of such a fragm ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The stable fragmentation with index of selfsimilarity α ∈ [−1/2, 0) is derived by looking at the masses of the subtrees formed by discarding the parts of a (1 + α) −1 –stable continuum random tree below height t, for t ≥ 0. We give a detailed limiting description of the distribution of such a
Results 1  10
of
128