Results 1 
3 of
3
Towards a typed geometry of interaction
, 2005
"... We introduce a typed version of Girard’s Geometry of Interaction, called Multiobject GoI (MGoI) semantics. We give an MGoI interpretation for multiplicative linear logic (MLL) without units which applies to new kinds of models, including finite dimensional vector spaces. For MGoI (i) we develop a v ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We introduce a typed version of Girard’s Geometry of Interaction, called Multiobject GoI (MGoI) semantics. We give an MGoI interpretation for multiplicative linear logic (MLL) without units which applies to new kinds of models, including finite dimensional vector spaces. For MGoI (i) we develop a version of partial traces and trace ideals (related to previous work of Abramsky, Blute, and Panangaden); (ii) we do not require the existence of a reflexive object for our interpretation (the original GoI 1 and 2 were untyped and hence involved a bureaucracy of domain equation isomorphisms); (iii) we introduce an abstract notion of orthogonality (related to work of Hyland and Schalk) and use this to develop a version of Girard’s theory of types, datum and algorithms in our setting, (iv) we prove appropriate Soundness and Completeness Theorems for our interpretations in partially traced categories with orthogonality; (v) we end with an application to completeness of (the original) untyped GoI in a unique decomposition category.
Some Results on the Functional Decomposition of Polynomials
, 1988
"... If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the existence of such functions g and h. In this thesis we consider functional decompositions of univariate and multivariate polynomials, and rational functi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the existence of such functions g and h. In this thesis we consider functional decompositions of univariate and multivariate polynomials, and rational functions over a field F of characteristic p. In the polynomial case, “wild” behaviour occurs in both the mathematical and computational theory of the problem if p divides the degree of g. We consider the wild case in some depth, and deal with those polynomials whose decompositions are in some sense the “wildest”: the additive polynomials. We determine the maximum number of decompositions and show some polynomial time algorithms for certain classes of polynomials with wild decompositions. For the rational function case we present a definition of the problem, a normalised version of the problem to which the general problem reduces, and an exponential time solution to the normal problem.
1PERMUTABLE POLYNOMIALS AND RELATED TOPICS
"... Let k be a field and k[x] the polynomial ring over k in one indeterminate. Consider the semigroup 〈k[x], ◦ 〉 where ◦ denotes the composition of polynomials defined as (f ◦ g)(x) = f(g(x)). The semigroup 〈k[x], ◦ 〉 is not commutative, i.e. the equality f ◦ g = g ◦ f does not hold in general. Thus the ..."
Abstract
 Add to MetaCart
Let k be a field and k[x] the polynomial ring over k in one indeterminate. Consider the semigroup 〈k[x], ◦ 〉 where ◦ denotes the composition of polynomials defined as (f ◦ g)(x) = f(g(x)). The semigroup 〈k[x], ◦ 〉 is not commutative, i.e. the equality f ◦ g = g ◦ f does not hold in general. Thus the question arises which specific polynomials f and g permute, i.e.