All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 35

Showing per page

Semantics of value recursion for monadic input/output

Levent Erkök, John Launchbury, Andrew Moran (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Monads have been employed in programming languages for modeling various language features, most importantly those that involve side effects. In particular, Haskell’s IO monad provides access to I/O operations and mutable variables, without compromising referential transparency. Cyclic definitions that involve monadic computations give rise to the concept of value-recursion, where the fixed-point computation takes place only over the values, without repeating or losing effects. In this paper, we...

Semantics of value recursion for Monadic Input/Output

Levent Erkök, John Launchbury, Andrew Moran (2010)

RAIRO - Theoretical Informatics and Applications

Monads have been employed in programming languages for modeling various language features, most importantly those that involve side effects. In particular, Haskell's IO monad provides access to I/O operations and mutable variables, without compromising referential transparency. Cyclic definitions that involve monadic computations give rise to the concept of value-recursion, where the fixed-point computation takes place only over the values, without repeating or losing effects. In this paper,...

Separable and Frobenius monoidal Hom-algebras

Yuanyuan Chen, Xiaoyan Zhou (2014)

Colloquium Mathematicae

As generalizations of separable and Frobenius algebras, separable and Frobenius monoidal Hom-algebras are introduced. They are all related to the Hom-Frobenius-separability equation (HFS-equation). We characterize these two Hom-algebraic structures by the same central element and different normalizing conditions, and the structure of these two types of monoidal Hom-algebras is studied. The Nakayama automorphisms of Frobenius monoidal Hom-algebras are considered.

Solving algebraic equations using coalgebra

Federico De Marchi, Neil Ghani, Christoph Lüth (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Algebraic systems of equations define functions using recursion where parameter passing is permitted. This generalizes the notion of a rational system of equations where parameter passing is prohibited. It has been known for some time that algebraic systems in Greibach Normal Form have unique solutions. This paper presents a categorical approach to algebraic systems of equations which generalizes the traditional approach in two ways i) we define algebraic equations for locally finitely presentable...

Solving Algebraic Equations Using Coalgebra

Federico De Marchi, Neil Ghani, Christoph Lüth (2010)

RAIRO - Theoretical Informatics and Applications

Algebraic systems of equations define functions using recursion where parameter passing is permitted. This generalizes the notion of a rational system of equations where parameter passing is prohibited. It has been known for some time that algebraic systems in Greibach Normal Form have unique solutions. This paper presents a categorical approach to algebraic systems of equations which generalizes the traditional approach in two ways i) we define algebraic equations for locally finitely presentable ...

Spaces and equations

Walter Taylor (2000)

Fundamenta Mathematicae

It is proved, for various spaces A, such as a surface of genus 2, a figure-eight, or a sphere of dimension ≠ 1,3,7, and for any set Σ of equations, that Σ cannot be modeled by continuous operations on A unless Σ is undemanding (a form of triviality that is defined in the paper).

Split structures.

Rosebrugh, Robert, Wood, R.J. (2004)

Theory and Applications of Categories [electronic only]

Stacks of group representations

Paul Balmer (2015)

Journal of the European Mathematical Society

We start with a small paradigm shift about group representations, namely the observation that restriction to a subgroup can be understood as an extension-of-scalars. We deduce that, given a group G , the derived and the stable categories of representations of a subgroup H can be constructed out of the corresponding category for G by a purely triangulated-categorical construction, analogous to étale extension in algebraic geometry. In the case of finite groups, we then use descent methods to investigate...

Currently displaying 1 – 20 of 35

Page 1 Next