Results 1  10
of
266
Rewrite Systems with Abstraction and βrule:Types, Approximants and Normalization
, 1996
"... In this paper we define and study intersection type assignment systems for firstorder rewriting extended withapplication, *abstraction, and fireduction (TRS+fi). One of the main results presented is that, using a suitablenotion of approximation of terms, any typeable term of a TRS+fi that satisf ..."
Abstract
 Add to MetaCart
In this paper we define and study intersection type assignment systems for firstorder rewriting extended withapplication, *abstraction, and fireduction (TRS+fi). One of the main results presented is that, using a suitablenotion of approximation of terms, any typeable term of a TRS+fi that satisfies a general scheme for recursivedefinitions has an approximant of the same type. From this result we deduce, for different classes of typeable terms, a headnormalization and a normalization theorem.
Polymorphic Intersection Type Assignment for Rewite Systems with Intersection and betarule (Extended Abstract)
 IN TYPES’99. LNCS
, 2000
"... We define two type assignment systems for firstorder rewriting extended with application,abstraction, andreduction (TRS). The types used in these systems are a combination of (free) intersection and polymorphic types. The first system is the general one, for which we prove a subject reduction t ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We define two type assignment systems for firstorder rewriting extended with application,abstraction, andreduction (TRS). The types used in these systems are a combination of (free) intersection and polymorphic types. The first system is the general one, for which we prove a subject reduction theorem and show that all typeable terms are strongly normalisable. The second is a decidable subsystem of the first, by restricting types to Rank 2. For this system we define, using an extended notion of unification, a notion of principal type, and show that type assignment is decidable.
BETA
, 2000
"... In Bikhchandani, Hirshleifer, and Welch’s (1992) specific model, it is showed that conformist behaviors can emerge due to information externalities. In this note we establish that this result, based on ‘informational cascades’, heavily depends on the choice of a particular tiebreaking convention. R ..."
Abstract
 Add to MetaCart
experimental designs. Keywords: Tiebreaking rules, informational cascades, experimental economics. JEL classification: C72, C92, D82.
Tertiary templates for proteins: Use of packing criteria in the enumeration of allowed sequences for dierent structural classes
 Journal of Molecular Biology
, 1987
"... We assume that each class of protein has a core structure that is defined by internal residues, and that the external, solventcontacting residues contribute to the stability of the structure, are of primary importance to function, but do not determine the architecture of the core portions of the po ..."
Abstract

Cited by 149 (2 self)
 Add to MetaCart
and are distributed throughout the polypeptide chain. The template is derived using the fixed positions for the mainchain and betacarbon atoms in the test structure and selected stereochemical rules. The focus of this paper is on the use of two packing criteria: avoidance of steric overlap and complete filling
Explicit Substitutions Calculi with Explicit Eta Rules
"... It has been argued that the notion of substitution in the λcalculus needs to be made explicit and many calculi have been developed in which the computational steps of the substitution operation involved in βcontractions have been atomised. In contrast to the great variety of developments for makin ..."
Abstract
 Add to MetaCart
for making explicit formalisations of the Beta rule, less work has been done for giving explicit definitions of the conditional Eta rule. In this paper constructive Eta rules are proposed for both the λσ and the λsecalculi of explicit substitutions. Our results can be summarised as follows: 1) we introduce
Shrinking Lambda Expressions in Linear Time
 Journal of Functional Programming
, 1997
"... Functionallanguage compilers often perform optimizations based on beta and delta reduction. To avoid speculative optimizations that can blow up the code size, we might wish to use only shrinking reduction rules guaranteed to make the program smaller: these include deadvariable elimination, constan ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
Functionallanguage compilers often perform optimizations based on beta and delta reduction. To avoid speculative optimizations that can blow up the code size, we might wish to use only shrinking reduction rules guaranteed to make the program smaller: these include deadvariable elimination
The Power of Neutrino Mass Sum Rules for Neutrinoless Double Beta Decay Experiments
, 2014
"... Neutrino mass sum rules relate the three neutrino masses within generic classes of flavour models, leading to restrictions on the effective mass parameter measured in experiments on neutrinoless double beta decay as a function of the lightest neutrino mass. We perform a comprehensive study of the im ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Neutrino mass sum rules relate the three neutrino masses within generic classes of flavour models, leading to restrictions on the effective mass parameter measured in experiments on neutrinoless double beta decay as a function of the lightest neutrino mass. We perform a comprehensive study
1 Fluxtube Structure, Sum Rules and Betafunctions in SU(2) ∗
, 1997
"... Action and energy fluxtube profiles are computed, in SU(2) with β = 2.4, 2.5, for two quarks up to 1 fm apart and for which the colour fields are in their ground state (A1g) and the first (Eu) and higher (A ′ 1g) excited gluonic states. When these profiles are integrated over all space, a scaling c ..."
Abstract
 Add to MetaCart
comparison is made between the β = 2.4 and 2.5 data. Using sum rules, these integrated forms also permit an estimate to be made of generalised βfunctions
Bayes ’ Rule of Information Bayes ’ Rule of Information
"... This chapter discusses a duality between the addition of random variables and the addition of information via Bayes ’ theorem: When adding independent random variables, variances (when they exist) add. With Bayes ’ theorem, defining “score ” and “observed information ” via derivatives of the log den ..."
Abstract
 Add to MetaCart
Carlo integration and Markov Chain Monte Carlo, for example. One important realm for application of these techniques is with various kinds of (extended) Kalman / Bayesian filtering following a 2step Bayesian sequential updating ch3Bayes Rule of Info2.doc 1 / 28 08/02/05Bayes ’ Rule of Information
Kernel stickbreaking processes
, 2007
"... Summary. This article proposes a class of kernel stickbreaking processes (KSBP) for uncountable collections of dependent random probability measures. The KSBP is constructed by first introducing an infinite sequence of random locations. Independent random probability measures and betadistributed ..."
Abstract

Cited by 74 (17 self)
 Add to MetaCart
Summary. This article proposes a class of kernel stickbreaking processes (KSBP) for uncountable collections of dependent random probability measures. The KSBP is constructed by first introducing an infinite sequence of random locations. Independent random probability measures and beta
Results 1  10
of
266