Related papers: An Offline Partial Evaluator for Evolving Algebras
In this article, we discuss a flow--sensitive analysis of equality relationships for imperative programs. We describe its semantic domains, general purpose operations over abstract computational states (term evaluation and identification,…
A survey on recent developments in (algebraic) integral geometry is given. The main focus lies on algebraic structures on the space of translation invariant valuations and applications in integral geometry.
Lecture notes from 2008 CMI/ETH Summer School on Evolution Equations. These notes are an informal introduction to the applications of microlocal methods in the study of linear evolution equations and spectral theory. Calculi of…
Despite the wide variety of input types in machine learning, this diversity is often not fully reflected in their representations or model architectures, leading to inefficiencies throughout a model's lifecycle. This paper introduces an…
We are interested in the evolution operators defined on commutative and nonassociative algebras when the scalar field is of characteristic 2. We distinguish four types: nilpotent, quasi-constant, ultimately periodic and plenary train…
Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable non-deterministic choices that would jeopardize the completeness of computations.…
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, a new partition refinement algorithm and associated tool CoPaR were developed that are generic in the transition type of the input…
We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras.…
This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…
It is significant and challenging to solve eigenvalue problems of partial differential operators when many highly accurate eigenpair approximations are required. The adaptive finite element discretization based parallel orbital-updating…
We consider integration of functions with values in a partially ordered vector space, and two notions of extension of the space of integrable functions. Applying both extensions to the space of real valued simple functions on a measure…
A model of computation is abstract if, when applied to any algebra, the resulting programs for computable functions and sets on that algebra are invariant under isomorphisms, and hence do not depend on a representation for the algebra.…
We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover. We describe the existing and planned functionality of the theorem…
In this paper are examined general classes of linear and non-linear analytical systems of partial differential equations. Indeed the integrability conditions are found and if they are satisfied, the solutions are given as functional series…
Partial evaluation has recently been used for processing SPARQL queries over a large resource description framework (RDF) graph in a distributed environment. However, the previous approach is inefficient when dealing with complex queries.…
We now have a rich and growing set of modeling tools and algorithms for inducing linguistic structure from text that is less than fully annotated. In this paper, we discuss some of the weaknesses of our current methodology. We present a new…
We formulate the notion of continuous evolution algebra in terms of differentiable matrix-valued functions, to then study those such algebras arising as solutions of ODE problems. Given their dependence on natural bases, matrix Lie groups…
This is a proposal of an algebra which aims at distributed array processing. The focus lies on re-arranging and distributing array data, which may be multi-dimensional. The context of the work is scientific processing; thus, the core…
This set of theories presents a formalisation in Isabelle/HOL+Isar of data dependencies between components. The approach allows to analyse system structure oriented towards efficient checking of system: it aims at elaborating for a concrete…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…