English
Related papers

Related papers: Partial Combinatory Algebras of Functions

200 papers

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

Formal Languages and Automata Theory · Computer Science 2025-09-30 Attila Egri-Nagy , Chrystopher L. Nehaniv

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

Logic · Mathematics 2017-05-26 Luca Mauri

We show that on real algebraic sets algebraically constructible functions coincide with the finite sums of signs of polynomials. Then we give some applications.

alg-geom · Mathematics 2008-02-03 Adam Parusinski , Zbigniew Szafraniec

For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…

Logic in Computer Science · Computer Science 2019-06-28 Jiri Adamek

A further significant extension is presented of the infinitely large class of differential algebras of generalized functions which are the basic structures in the nonlinear algebraic theory listed under 46F30 in the AMS Mathematical Subject…

General Mathematics · Mathematics 2010-06-29 Elemer E Rosinger

Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…

Logic · Mathematics 2020-04-30 H. P. Barendregt , S. A. Terwijn

Factoring out the spin $1$ subalgebra of a $ W $ algebra leads to a new $ W $ structure which can be seen either as a rational finitely generated $ W $ algebra or as a polynomial non-linear $ W_\infty$ realization.

High Energy Physics - Theory · Physics 2009-10-22 F. Delduc , L. Frappat , P. Sorba , F. Toppan , E. Ragoucy

A compact T-algebra is an initial T-algebra whose inverse is a final T-coalgebra. Functors with this property are said to be algebraically compact. This is a very strong property used in programming semantics which allows one to interpret…

Logic in Computer Science · Computer Science 2020-09-16 Vladimir Zamdzhiev

We introduce partial group algebras with relations in a purely algebraic framework. Given a group and a set of relations, we define an algebraic partial action and prove that the resulting partial skew group ring is isomorphic to the…

Rings and Algebras · Mathematics 2025-12-16 Giuliano Boava , Gilles G. de Castro , Daniel Gonçalves , Daniel W. van Wyk

In this note we study associative dialgebras proving that the most interesting such structures arise precisely when the algebra is not semiprime. In fact the presence of some "perfection" property (simpleness, primitiveness, primeness or…

Rings and Algebras · Mathematics 2010-12-23 Candido Martin Gonzalez

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…

Rings and Algebras · Mathematics 2017-08-01 Brett McLean

In this paper we look at normed spaces of differentiable functions on compact plane sets, including the spaces of infinitely differentiable functions originally considered by Dales and Davie. For many compact plane sets the classical…

Functional Analysis · Mathematics 2007-05-23 W. J. Bland , J. F. Feinstein

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…

Formal Languages and Automata Theory · Computer Science 2019-06-25 Jane Chandlee , Remi Eyraud , Jeffrey Heinz , Adam Jardine , Jonathan Rawski

We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…

Logic in Computer Science · Computer Science 2024-05-17 Masahito Hasegawa , Serge Lechenne

The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…

Logic in Computer Science · Computer Science 2015-07-01 Jean-Louis Krivine

Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…

Logic in Computer Science · Computer Science 2015-06-25 Baltasar Trancón y Widemann , Michael Hauhs

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Ciraulo , Michele Contente

We define the notion of a partial action on a generalized Boolean algebra and associate to every such system and commutative unital ring $R$ an $R$-algebra. We prove that every strongly $E^{\ast}$-unitary inverse semigroup has an associated…

Rings and Algebras · Mathematics 2025-03-04 Allen Zhang

Partial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial…

Programming Languages · Computer Science 2020-02-19 Maximiliano Cristia , Gianfranco Rossi , Claudia Frydman