Results 1  10
of
14,926
for kpowerfreeness of uniform morphisms
, 2008
"... A challenging problem is to find an algorithm to decide whether a morphism is kpowerfree. We provide such an algorithm when k ≥ 3 for uniform morphisms showing that in such a case, contrarily to the general case, there exist finite testsets for kpowerfreeness. ..."
Abstract
 Add to MetaCart
A challenging problem is to find an algorithm to decide whether a morphism is kpowerfree. We provide such an algorithm when k ≥ 3 for uniform morphisms showing that in such a case, contrarily to the general case, there exist finite testsets for kpowerfreeness.
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the applicability of theoretical results to real situations. In this paper we introduce a new calculus based on a categorical semantics for computations. This calculus provides a correct basis for proving equivalence of programs, independent from any specific computational model. 1 Introduction This paper is about logics for reasoning about programs, in particular for proving equivalence of programs. Following a consolidated tradition in theoretical computer science we identify programs with the closed terms, possibly containing extra constants, corresponding to some features of the programming language under consideration. There are three approaches to proving equivalence of programs: ffl T...
Systematic design of program analysis frameworks
 In 6th POPL
, 1979
"... Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant ..."
Abstract

Cited by 771 (52 self)
 Add to MetaCart
Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Monads for functional programming
, 1995
"... The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or nondeterminism. Three case studies are looked at in detail: how monads ease the modification o ..."
Abstract

Cited by 1481 (39 self)
 Add to MetaCart
The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or nondeterminism. Three case studies are looked at in detail: how monads ease the modification of a simple evaluator; how monads act as the basis of a datatype of arrays subject to inplace update; and how monads can be used to build parsers.
GromovWitten classes, quantum cohomology, and enumerative geometry
 Commun. Math. Phys
, 1994
"... The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov–Witten classes, and a discussion of their properties for Fano varieties. Cohomological ..."
Abstract

Cited by 484 (3 self)
 Add to MetaCart
The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov–Witten classes, and a discussion of their properties for Fano varieties. Cohomological Field Theories are defined, and it is proved that tree level theories are determined by their correlation functions. Application to counting rational curves on del Pezzo surfaces and projective spaces are given. Let V be a projective algebraic manifold. Methods of quantum field theory recently led to a prediction of some numerical characteristics of the space of algebraic curves in V, especially of genus zero, eventually endowed with a parametrization and marked points. It turned out that
On the Complexity of Free Monoid Morphisms
, 1999
"... . We locate the complexities of evaluating, of inverting, and of testing membership in the image of, morphisms h : \Sigma ! \Delta . By and large, we show these problems complete for classes within NL. Then we develop new properties of finite codes and of finite sets of words, which yield imag ..."
Abstract
 Add to MetaCart
image membership subproblems that are closely tied to the unambiguous space classes found between L and NL. 1 Introduction Free monoid morphisms h : \Sigma ! \Delta , for finite alphabets \Sigma and \Delta, are an important concept in the theory of formal languages (e.g. [6, 11
Computing with Membranes
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1998
"... We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a structure consists of several celllike membranes, recurrently placed inside a unique "skin" membrane. A plane representation is a Venn diagram without intersected se ..."
Abstract

Cited by 425 (4 self)
 Add to MetaCart
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a structure consists of several celllike membranes, recurrently placed inside a unique "skin" membrane. A plane representation is a Venn diagram without intersected sets and with a unique superset. In the regions delimited by the membranes there are placed objects; the obtained construct is called a supercell. These objects are assumed to evolve: each object can be transformed in other objects, can pas through a membrane, or can disolve the membrane in which it is placed. A priority relation between evolution rules can be considered. The evolution is done in parallel for all objects able to evolve. In this way, we obtain a computing device (we call it a supercell system): start with a certain number of objects in a certain membrane and let the system evolve; if it will halt (no object can further evolve), then the computation is finished, with the result given as...
Algebras and Modules in Monoidal Model Categories
 Proc. London Math. Soc
, 1998
"... In recent years the theory of structured ring spectra (formerly known as A #  and E # ring spectra) has been signicantly simplified by the discovery of categories of spectra with strictly associative and commutative smash products. Now a ring spectrum can simply be dened as a monoid with respect t ..."
Abstract

Cited by 243 (34 self)
 Add to MetaCart
In recent years the theory of structured ring spectra (formerly known as A #  and E # ring spectra) has been signicantly simplified by the discovery of categories of spectra with strictly associative and commutative smash products. Now a ring spectrum can simply be dened as a monoid with respect
Results 1  10
of
14,926