The Experts below are selected from a list of 192003 Experts worldwide ranked by ideXlab platform
Adolfo Piperno - One of the best experts on this subject based on the ideXlab platform.
-
RTA - Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus
2002Co-Authors: Richard Kennaway, Zurab Khasidashvili, Adolfo PipernoAbstract:We investigate the degree of parallelism (or modularity) in the hyperbalanced ?-calculus, ?H, a subcalculus of ?-calculus containing all simply typable terms (up to a restricted ?-expansion). In technical terms, we study the Family Relation on redexes in ?H, and the contribution Relation on redex-families, and show that the latter is a forest (as a partial order). This means that hyperbalanced ?-terms allow for maximal possible parallelism in computation. To prove our results, we use and further refine, for the case of hyperbalanced terms, some well known results concerning paths, which allow for static analysis of many fundamental properties of s-reduction.
-
Static analysis of modularity of β-reduction in the hyperbalanced λ-calculus
Lecture Notes in Computer Science, 2002Co-Authors: Richard Kennaway, Zurab Khasidashvili, Adolfo PipernoAbstract:We investigate the degree of parallelism (or modularity) in the hyperbalanced λ-calculus, λ H , a subcalculus of λ-calculus containing all simply typable terms (up to a restricted η-expansion). In technical terms, we study the Family Relation on redexes in λ H , and the contribution Relation on redex-families, and show that the latter is a forest (as a partial order). This means that hyperbalanced λ-terms allow for maximal possible parallelism in computation. To prove our results, we use and further refine, for the case of hyperbalanced terms, some well known results concerning paths, which allow for static analysis of many fundamental properties of β-reduction.
Caroline Martin - One of the best experts on this subject based on the ideXlab platform.
-
Discriminant factors for adolescent sexual offending: On the usefulness of considering both victim age and sibling incest.
Child abuse & neglect, 2016Co-Authors: Christian C. Joyal, Julie Carpentier, Caroline MartinAbstract:Understanding the pathways and circumstances of juvenile sexual offending is of utmost importance. However, juvenile sexual offenders (JSO) represent an especially diverse group of individuals, and several categorizations have been proposed to obtain more homogeneous subgroups. Victim age-based and Family Relation-based categorizations are particularly promising because they seem theoretically and clinically relevant. Empirical results however are still inconsistent, and most studies have not considered these two dimensions jointly. The first goal of this study was to further examine the value of subgrouping JSO according to the age of their victim. A second goal was to determine the supplementary value, if any, of considering sibling incest. Based on a sample of 351 male JSO, it was first confirmed that sexual abuse of children was more strongly related to asociality (social skill deficits) than sexual abuse of peers, the latter being more closely associated with antisociality (general delinquency). The relevance of considering mixed-type JSO (with both child and peer victims) separately was also confirmed. More importantly, multivariate statistical analyses demonstrated that adding sibling incest to the equation was useful. JSO of intra-familial child were significantly more likely to have been victimized during their own childhood compared to JSO with extra-familial victims. Nevertheless, adolescents who had committed sibling incest obtained middle ground results on most variables (except for crime severity), suggesting that they constitute a distinct but not extreme, subgroup. This study confirmed the utility of using both the age and the Family Relation with the victim in characterizing juvenile sexual offending.
Richard Kennaway - One of the best experts on this subject based on the ideXlab platform.
-
RTA - Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus
2002Co-Authors: Richard Kennaway, Zurab Khasidashvili, Adolfo PipernoAbstract:We investigate the degree of parallelism (or modularity) in the hyperbalanced ?-calculus, ?H, a subcalculus of ?-calculus containing all simply typable terms (up to a restricted ?-expansion). In technical terms, we study the Family Relation on redexes in ?H, and the contribution Relation on redex-families, and show that the latter is a forest (as a partial order). This means that hyperbalanced ?-terms allow for maximal possible parallelism in computation. To prove our results, we use and further refine, for the case of hyperbalanced terms, some well known results concerning paths, which allow for static analysis of many fundamental properties of s-reduction.
-
Static analysis of modularity of β-reduction in the hyperbalanced λ-calculus
Lecture Notes in Computer Science, 2002Co-Authors: Richard Kennaway, Zurab Khasidashvili, Adolfo PipernoAbstract:We investigate the degree of parallelism (or modularity) in the hyperbalanced λ-calculus, λ H , a subcalculus of λ-calculus containing all simply typable terms (up to a restricted η-expansion). In technical terms, we study the Family Relation on redexes in λ H , and the contribution Relation on redex-families, and show that the latter is a forest (as a partial order). This means that hyperbalanced λ-terms allow for maximal possible parallelism in computation. To prove our results, we use and further refine, for the case of hyperbalanced terms, some well known results concerning paths, which allow for static analysis of many fundamental properties of β-reduction.
Cosimo Laneve - One of the best experts on this subject based on the ideXlab platform.
-
Interaction systems II: the practice of optimal reductions
Theoretical Computer Science, 1996Co-Authors: Andrea Asperti, Cosimo LaneveAbstract:Abstract Lamping's optimal graph reduction technique for the λ-calculus is generalized to a new class of higher-order rewriting systems, called Interaction Systems. Interaction Systems provide a nice integration of the functional paradigm with a rich class of data structures (all inductive types), and some basic control flow constructs such as conditionals and (primitive or general) recursion. We describe a uniform and optimal implementation, in Lamping's style, for all these features. The paper is the natural continuation of [3], where we focused on the theoretical aspects of optimal reductions in Interaction Systems (Family Relation, labeling, extraction).
-
An Investigation on the Optimal Implementation of Processes
1996Co-Authors: Cosimo LaneveAbstract:We undertake the analysis of Levy''s notion of Family Relation in a concurrent scenario by providing an optimal implementation of an higher-order, concurrent language. The language considered turns out to be a sub-language of (pure) Concurrent ML, where transmissible processes cannot show up any nondeterminism.
-
TACS - The Family Relation in Interaction Systems
Lecture Notes in Computer Science, 1994Co-Authors: Andrea Asperti, Cosimo LaneveAbstract:The Family Relation over redexes, introduced by Levy [8] for the λ-calculus, essentially generalizes the notion of residual to the case of dynamic creation of new redexes, providing the main theoretical tool for the theory of optimal reductions. In this paper, we investigate the same notion in a powerful supersystem of the λ-calculus, recently introduced by the authors, and called Interaction Systems.
-
Interaction Systems II: The Practice of Optimal Reductions
1993Co-Authors: Andrea Asperti, Cosimo LaneveAbstract:Lamping''s optimal graph reduction technique for the lambda-calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems provide a nice integration of the functional paradigm with a rich class of data structures (all inductive types), and some basic control flow constructs such as conditionals and (primitive or general) recursion. We describe a uniform and optimal implementation, in Lamping''s style, for all these features. This work is the natural continuation of our previous paper "Interaction systems I, the theory of optimal reductions", where we focused on the theoretical aspects of optimal reductions in IS''s (Family Relation, labeling, extraction, an so on).
-
Interaction systems II : the practice of optimal reductions
1993Co-Authors: Andrea Asperti, Cosimo LaneveAbstract:Lamping's optimal graph reduction technique for the l-calculus is generalized to a new class of higher order rewriting systems, called interaction systems. Interaction systems provide a nice integration of the functional paradigm with a rich class of data structures (all inductive types) and some basic control flow constructs such as conditionals and (primitive or general) recursion. We describe a uniform and optimal implementation in Lamping's style, for all these features. The paper is natural continuation where we focused on the theoretical aspects of optimal reductions in interaction systems (Family Relation, labeling, extraction, ...).
Zhang Qian - One of the best experts on this subject based on the ideXlab platform.
-
INVESTIGATION ON THE CORRelation BETWEEN SELF-CONFIDENCE、LEARNING MOTIVATION AND Family RelationSHIP OF FRESHERS IN SOME MEDICAL SCHOOL
Modern Preventive Medicine, 2007Co-Authors: Zhang QianAbstract:[Objective]To understand the status of Family Relationship,self-confidence and learning motivation of students in some medical school,provide school basic materials to develop psychological counseling service and provide basis for exploring active Family Relationship for students' growth;and find out the individuals who have bad Family Relationship and lack self-confidence to give early intervention.[Methods]A cross-sectional investigation was conducted among medical students with Family Relationship scale,self-confidence scale and learning motivation scale.[Results]The percentage of student whose attitude towards his Family Relationship in three levels of extraordinary satisfaction,comparative satisfaction and no satisfaction was 78.7%,16.2% and 5.2% respectively.The proportions of students whose self-confidence in levels of high,normal,rather low,low and inferiority respectively were 27.5%,28.8%,15.8%,16.0% and 11.9%.And the proportions of students with learning motivation in levels of strong,moderate and weak were 19.0%,64.7% and 16.2% respectively.[Conclusions]The status of Family Relation,self-confidence and learning motivation of freshmen in some medical school is normal in general.The Family Relation has great influences on the self-confidence and learning motivation of students.
