Titlebook: Logic-Based Program Synthesis and Transformation; 25th International S Moreno Falaschi Conference proceedings 2015 Springer International P

評(píng)論性

On Dual Programs in Co-Logic Programming coinductive. To define its procedural semantics as well as an alternating fixpoint semantics, the ., a condition on predicate dependency in programs, has been imposed on co-logic programs (co-LPs). In this paper, we first consider . programs in co-logic programming: Given a program ., its dual prog

mitral-valve

Equational Formulas and Pattern Operations in Initial Order-Sorted Algebrasatterns can represent Boolean operations on languages. But for the more expressive patterns needed in declarative languages supporting rich type disciplines such as subtype polymorphism untyped pattern operations and algorithms break down. We show how they can be properly defined by means of a signa

GRILL

Compiling Collapsing Rules in Certain Constructor Systemse notion of a needed step in some constructor systems offer a new approach to this problem. We present two results: a transformation of a certain class of constructor-based rewrite systems that eliminates collapsing rules, and a rewrite-like relation that takes advantage of the absence of collapsing

AGOG

DAUNT

A Type-Theoretic Approach to Resolutioniven query as a construction of the inhabitant (a proof-term) for the type given by the query. We propose a method of program transformation that allows to transform logic programs in such a way that proof evidence is computed alongside SLD-derivations. We discuss two applications of this approach:

linear

A Typed Language for Eventsepresent the kind of actions that can occur in a system, and . events, which represent actual occurrences of those kinds of actions. A relation is given associating specific to generic events, as well as a method for obtaining intervals from a history of events. We describe applications in access co

引水渠

headlong

Impact of Accuracy Optimization on the Convergence of Numerical Iterative?Methods this is why we switch to automatic transformation techniques. We are interested in the optimization of numerical programs relying on the IEEE754 floating-point arithmetic. In this article, our main contribution is to study the impact of optimizing the numerical accuracy of programs on the time requ

Costume

Abstract Analysis of Universal Properties for ,stems, where infinite behaviors arise naturally. In previous works, a semantic framework and abstract diagnosis method for the language has been defined..On the basis of that semantic framework, this paper proposes an abstract semantics that, together with a widening operator, is suitable for the de

fatuity