Using parametric set constraints for locating errors in CLP programs

This paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP). It proposes a method for locating type errors in CLP programs and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type specifications. The approach is based on a generalization of known methods for proving correctness of logic programs to the case of parametric specifications. Set-constraint techniques are used for formulating and checking verification conditions for (parametric) polymorphic type specifications. The specifications are expressed in a parametric extension of the formalism of term grammars. The soundness of the method is proved and the prototype debugging tool supporting the proposed approach is illustrated on examples. The paper is a substantial extension of the previous work by the same authors concerning monomorphic directional types.Comment: 64 pages, To appear in Theory and Practice of Logic Programmin

Our LIPS are sealed: interfacing logic and functional programming systems

technical reportWe report on a technique for interfacing an untyped logic language to a statically poly morphically typed functional language Our key insight is that polymorphic types can be interpreted as "need to know" specifications on function arguments. This leads to a criterion for liberally yet safely invoking the functional language to reduce application terms as required during unification in the logic language. This method called P unification enriches the capabilities of each language while retaining the integrity of their individual semantics and implementation technologies An experimental test has been successfully performed whereby a Horn clause logic programming (HCLP) interpreter written in Common Lisp was interfaced to the Standard ML of New Jersey system. The latter implementation was employed (i) on untyped or dynamically typed data, even though it is statically typed (ii) lazily, even though it is strict and (iii) on alien HCLP terms such as unbound variables - without the slightest modification

A grammatical view of logic programming

Résumé disponible dans les fichiers attaché

Modelling data dependencies in logic programs by attribute schemata

Résumé disponible dans les fichiers attaché

Relating logic programs and attribute grammars

Résumé disponible dans les fichiers attaché

On the role of semantic approximations in validation and diagnosis of constraint logic programs

Abstract is not available

Haploid and Doubled Haploid Techniques in Perennial Ryegrass (Lolium perenne L.) to Advance Research and Breeding

The importance of haploid and doubled haploid (DH) techniques for basic and applied research, as well as to improve the speed of genetic gain when applied in breeding programs, cannot be overstated. They have become routine tools in several major crop species, such as maize (Zea mays L.), wheat (Triticum aestivum L.), and barley (Hordeum vulgare L.). DH techniques in perennial ryegrass (Lolium perenne L.), an important forage species, have advanced to a sufficiently successful and promising stage to merit an exploration of what their further developments may bring. The exploitation of both in vitro and in vivo haploid and DH methods to (1) purge deleterious alleles from germplasm intended for breeding; (2) develop mapping populations for genetic and genomic studies; (3) simplify haplotype mapping; (4) fix transgenes and mutations for functional gene validation and molecular breeding; and (5) hybrid cultivar development are discussed. Even with the comparatively modest budgets of those active in forage crop improvement, haploid and DH techniques can be developed into powerful tools to achieve the acceleration of the speed of genetic gain needed to meet future agricultural demands

CP debugging needs and tools

Conventional programming techniques are not well suited for solving many highly combinatorial industrial problems, like scheduling, decision making, resource allocation or planning. Constraint Programming (CP), an emerging software technology, offers an original approach allowing for efficient and flexible solving of complex problems, through combined implementation of various constraint solvers and expert heuristics. Its applications are increasingly elded in various industries

Reverse breeding: a novel breeding approach based on engineered meiosis

Reverse breeding (RB) is a novel plant breeding technique designed to directly produce parental lines for any heterozygous plant, one of the most sought after goals in plant breeding. RB generates perfectly complementing homozygous parental lines through engineered meiosis. The method is based on reducing genetic recombination in the selected heterozygote by eliminating meiotic crossing over. Male or female spores obtained from such plants contain combinations of non-recombinant parental chromosomes which can be cultured in vitro to generate homozygous doubled haploid plants (DHs). From these DHs, complementary parents can be selected and used to reconstitute the heterozygote in perpetuity. Since the fixation of unknown heterozygous genotypes is impossible in traditional plant breeding, RB could fundamentally change future plant breeding. In this review, we discuss various other applications of RB, including breeding per chromosome