Results 1  10
of
18
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 436 (6 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...
A Mixed Linear and NonLinear Logic: Proofs, Terms and Models (Preliminary Report)
, 1994
"... Intuitionistic linear logic regains the expressive power of intuitionistic logic through the ! (`of course') modality. Benton, Bierman, Hyland and de Paiva have given a term assignment system for ILL and an associated notion of categorical model in which the ! modality is modelled by a comonad satis ..."
Abstract

Cited by 94 (3 self)
 Add to MetaCart
Intuitionistic linear logic regains the expressive power of intuitionistic logic through the ! (`of course') modality. Benton, Bierman, Hyland and de Paiva have given a term assignment system for ILL and an associated notion of categorical model in which the ! modality is modelled by a comonad satisfying certain extra conditions. Ordinary intuitionistic logic is then modelled in a cartesian closed category which arises as a full subcategory of the category of coalgebras for the comonad. This paper attempts to explain the connection between ILL and IL more directly and symmetrically by giving a logic, term calculus and categorical model for a system in which the linear and nonlinear worlds exist on an equal footing, with operations allowing one to pass in both directions. We start from the categorical model of ILL given by Benton, Bierman, Hyland and de Paiva and show that this is equivalent to having a symmetric monoidal adjunction between a symmetric monoidal closed category and a cartesian closed category. We then derive both a sequent calculus and a natural deduction presentation of the logic corresponding to the new notion of model.
Categorical Models for Local Names
 LISP AND SYMBOLIC COMPUTATION
, 1996
"... This paper describes the construction of categorical models for the nucalculus, a language that combines higherorder functions with dynamically created names. Names are created with local scope, they can be compared with each other and passed around through function application, but that is all. T ..."
Abstract

Cited by 39 (2 self)
 Add to MetaCart
This paper describes the construction of categorical models for the nucalculus, a language that combines higherorder functions with dynamically created names. Names are created with local scope, they can be compared with each other and passed around through function application, but that is all. The intent behind this language is to examine one aspect of the imperative character of Standard ML: the use of local state by dynamic creation of references. The nucalculus is equivalent to a certain fragment of ML, omitting side effects, exceptions, datatypes and recursion. Even without all these features, the interaction of name creation with higherorder functions can be complex and subtle; it is particularly difficult to characterise the observable behaviour of expressions. Categorical monads, in the style of Moggi, are used to build denotational models for the nucalculus. An intermediate stage is the use of a computational metalanguage, which distinguishes in the type system between values and computations. The general requirements for a categorical model are presented, and two specific examples described in detail. These provide a sound denotational semantics for the nucalculus, and can be used to reason about observable equivalence in the language. In particular a model using logical relations is fully abstract for firstorder expressions.
Monads for which structures are adjoint to units
 Aarhus Preprint Series 1972/73 No.35
"... We present here the equational twodimensional categorical algebra which describes the process of freely completing a category under some class of limits or colimits. It is crystallized out of the authors 1967 dissertation [6] (revised form [7]). I presented a purely equational aspect of that alread ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
We present here the equational twodimensional categorical algebra which describes the process of freely completing a category under some class of limits or colimits. It is crystallized out of the authors 1967 dissertation [6] (revised form [7]). I presented a purely equational aspect of that already
The Structure of CallbyValue
, 2000
"... To my parents Understanding procedure calls is crucial in computer science and everyday programming. Among the most common strategies for passing procedure arguments (‘evaluation strategies’) are ‘callbyname’, ‘callbyneed’, and ‘callbyvalue’, where the latter is the most commonly used. While ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
To my parents Understanding procedure calls is crucial in computer science and everyday programming. Among the most common strategies for passing procedure arguments (‘evaluation strategies’) are ‘callbyname’, ‘callbyneed’, and ‘callbyvalue’, where the latter is the most commonly used. While reasoning about procedure calls is simple for callbyname, problems arise for callbyneed and callbyvalue, because it matters how often and in which order the arguments of a procedure are evaluated. We shall classify these problems and see that all of them occur for callbyvalue, some occur for callbyneed, and none occur for callbyname. In that sense, callbyvalue is the ‘greatest common denominator ’ of the three evaluation strategies. Reasoning about callbyvalue programs has been tackled by Eugenio Moggi’s ‘computational lambdacalculus’, which is based on a distinction between ‘values’
Recursive Types in Kleisli Categories
 Preprint 2004. MFPS Tutorial, April 2007 Classical Domain Theory 75/75
, 1992
"... We show that an enriched version of Freyd's principle of versality holds in the Kleisli category of a commutative strong monad with fixedpoint object. This gives a general categorical setting in which it is possible to model recursive types involving the usual datatype constructors. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We show that an enriched version of Freyd's principle of versality holds in the Kleisli category of a commutative strong monad with fixedpoint object. This gives a general categorical setting in which it is possible to model recursive types involving the usual datatype constructors.
Algebraic foundations for effectdependent optimisations
 In POPL
, 2012
"... We present a general theory of Giffordstyle type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebraic effects, a development of Moggi’s monadic theory of computational effects that emphasises the operations causing the e ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present a general theory of Giffordstyle type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebraic effects, a development of Moggi’s monadic theory of computational effects that emphasises the operations causing the effects at hand and their equational theory. The key observation is that annotation effects can be identified with operation symbols. We develop an annotated version of Levy’s CallbyPushValue language with a kind of computations for every effect set; it can be thought of as a sequential, annotated intermediate language. We develop a range of validated optimisations (i.e., equivalences), generalising many existing ones and adding new ones. We classify these optimisations as structural, algebraic, or abstract: structural optimisations always hold; algebraic ones depend on the effect theory at hand; and abstract ones depend on the global nature of that theory (we give modularlycheckable sufficient conditions for their validity).
The Constructive Lift Monad
 Informix Software, Inc
, 1995
"... ut by applying T to some poset (namely the original poset less the bottom). Both these properties fail to hold constructively, if the lift monad is interpreted as "adding a bottom"; see Remark below. If, on the other hand, we interpret the lift monad as the one which freely provides supremum for ea ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
ut by applying T to some poset (namely the original poset less the bottom). Both these properties fail to hold constructively, if the lift monad is interpreted as "adding a bottom"; see Remark below. If, on the other hand, we interpret the lift monad as the one which freely provides supremum for each subset with at most one element (which is what we shall do), then the first property holds; and we give a necessary and sufficient condition that the second does. Finally, we shall investigate the lift monad in the context of (constructive) locale theory. I would like to thank Bart Jacobs for guiding me to the litterature on Zsystems; to Gonzalo Reyes for calling my attention to Barr's work on totally connected spaces; to Steve Vickers for some pertinent correspondence. I would like to thank the Netherlands Science Organization (NWO) for supporting my visit to Utrecht, where a part of the present research was carried out, and for various travel support from
Involutive categories and monoids, with a GNScorrespondence
 In Quantum Physics and Logic (QPL
, 2010
"... This paper develops the basics of the theory of involutive categories and shows that such categories provide the natural setting in which to describe involutive monoids. It is shown how categories of EilenbergMoore algebras of involutive monads are involutive, with conjugation for modules and vecto ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper develops the basics of the theory of involutive categories and shows that such categories provide the natural setting in which to describe involutive monoids. It is shown how categories of EilenbergMoore algebras of involutive monads are involutive, with conjugation for modules and vector spaces as special case. The core of the socalled GelfandNaimarkSegal (GNS) construction is identified as a bijective correspondence between states on involutive monoids and inner products. This correspondence exists in arbritrary involutive symmetric monoidal categories. 1
Convexity, duality, and effects
 IFIP Theoretical Computer Science 2010, number 82(1) in IFIP Adv. in Inf. and Comm. Techn
, 2010
"... This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new class of functors that we call ‘convex functors’; they include what are usually called probability distribution functors. T ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new class of functors that we call ‘convex functors’; they include what are usually called probability distribution functors. These relationships take the form of three adjunctions. Two of these three are ‘dual ’ adjunctions for convex sets, one time with the Boolean truth values {0, 1} as dualising object, and one time with the probablity values [0, 1]. The third adjunction is between effect algebras and convex functors. 1