Searcharxiv⌕ Search

arXiv subjects

Antonio Bucciarelli

Publications and source records attributed to Antonio Bucciarelli.

14 recordsLinked to original sources
arXiv2026

From clones to cm-monoids

Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones, clone algebras (previously introduced by the first and the third author), and Neumann's aleph0-abstract clones, while modelling the interplay of infinitary operations. Cm-monoids combine a monoid structure with a new algebraic structure called merge algebra, capturing essential properties of infinite sequences of operations. We establish a categorical equivalence between clone algebras and finitely-ranked cm-monoids. This equivalence yields by restriction a three-fold equivalence between abstract clones, finite-dimensional clone algebras, and finite-dimensional, finitely ranked cm-monoids, and is itself obtained by restriction from a categorical equivalence between partial infinitary clone algebras (which generalise clone algebras) and extensional cm-monoids. In a companion work, we develop the theory of modules over cm-monoids, offering a unified approach to polymorphisms and invariant relations, in the hope of providing new insights into algebraic structures and CSP complexity theory.

math.CT↗
arXiv2026

Groups and Inverse Semigroups in Lambda Calculus

We study invertibility of $λ$-terms modulo $λ$-theories. Here a fundamental role is played by a class of $λ$-terms called finite hereditary permutations (FHP) and by their infinite generalisations (HP). More precisely, FHPs are the invertible elements in the least extensional $λ$-theory $λη$ and HPs are those in the greatest sensible $λ$-theory $H^*$. Our approach is based on inverse semigroups, algebraic structures that generalise groups and semilattices. We show that FHP modulo a $λ$-theory $T$ is always an inverse semigroup and that HP modulo $T$ is an inverse semigroup whenever $T$ contains the theory of Böhm trees. An inverse semigroup comes equipped with a natural order. We prove that the natural order corresponds to $η$-expansion in $\mathrm{FHP} /T$, and to infinite $η$-expansion in $\mathrm{HP}/T$. Building on these correspondences we obtain the two main contributions of this work: firstly, we recast in a broader framework the results cited at the beginning; secondly, we prove that the FHPs are the invertible $λ$-terms in all the $λ$-theories lying between $λη$ and $H^+$. The latter is Morris' observational $λ$-theory, defined by using the $β$-normal forms as observables.

cs.LO↗
arXiv2024

Exploring New Topologies for the Theory of Clones

Clones of operations of arity omega (referred to as omega-operations) have been employed by Neumann to represent varieties of infinitary algebras defined by operations of at most arity omega. More recently, clone algebras have been introduced to study clones of functions, including omega-operations, within the framework of one-sorted universal algebra. Additionally, polymorphisms of arity omega, which are omega-operations preserving the relations of a given first-order structure, have recently been used to establish model theory results with applications in the field of complexity of CSP problems. In this paper, we undertake a topological and algebraic study of polymorphisms of arity omega and their corresponding invariant relations. Given a set A and a Boolean ideal X on the set of omega-sequences of elements of A, we propose a method to endow the set of omega-operations on A with a topology, which we refer to as X-topology. Notably, the topology of pointwise convergence can be retrieved as a special case of this approach. Polymorphisms and invariant relations are then defined parametrically, with respect to the X-topology. We characterise the X-closed clones of omega-operations in terms of polymorphisms and invariant relations of arity omega, and present a method to relate those infinitary invariant relation and polymorphisms to the classical (finitary) Inv-Pol.

cs.LO↗
arXiv2024

The higher dimensional propositional calculus

In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth values. This paper presents a sound and complete sequent calculus for nCL, named nLK. We provide two proofs of completeness: one syntactic and one semantic. The former implies as a corollary that nLK enjoys the cut admissibility property. The latter relies on the generalisation to the n-ary case of the classical proof based on the Lindenbaum algebra of formulas and Boolean ultrafilters.

cs.LO↗
arXiv2023

The Bang Calculus Revisited

Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Callby-Name (CBN) and Call-by-Value (CBV) semantics. The essence of this paradigm is captured by the Bang Calculus, a (concise) term language connecting CBPV and Linear Logic. This paper presents a revisited version of the Bang Calculus, called $λ!$, enjoying some important properties missing in the original formulation. Indeed, the new calculus integrates permutative conversions to unblock value redexes while being confluent at the same time. A second contribution is related to nonidempotent types. We provide a quantitative type system for our $λ!$-calculus, and we show that the length of the (weak) reduction of a typed term to its normal form plus the size of this normal form is bounded by the size of its type derivation. We also explore the properties of this type system with respect to CBN/CBV translations. We keep the original CBN translation from $λ$-calculus to the Bang Calculus, which preserves normal forms and is sound and complete with respect to the (quantitative) type system for CBN. However, in the case of CBV, we reformulate both the translation and the type system to restore two main properties: preservation of normal forms and completeness. Last but not least, the quantitative system is refined to a tight one, which transforms the previous upper bound on the length of reduction to normal form plus its size into two independent exact measures for them.

cs.LO↗
arXiv2022

Boolean-like algebras of finite dimension

We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the so-called n-central elements. Varieties of nBAs share many remarkable properties with the variety of Boolean algebras and with primal varieties. Exploiting the concept of central element, we extend the notion of Boolean power to that of semiring power and we prove two representation theorems: (i) Any pure nBA is isomorphic to the algebra of n-central elements of a Boolean vector space; (ii) Any member of a variety of nBAs with one generator is isomorphic to a Boolean power of this generator. This gives a new proof of Foster's theorem on primal varieties.

cs.LO↗
arXiv2021

Solvability = Typability + Inhabitation

We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on non-idempotent types. We show first that the system P characterizes the set of terms having canonical form, i.e. that a term is typable if and only if it reduces to a canonical form. But the set of solvable terms is properly contained in the set of canonical forms. Thus, typability alone is not sufficient to characterize solvability, in contrast to the case for the lambda-calculus. We then prove that typability, together with inhabitation, provides a full characterization of solvability, in the sense that a term is solvable if and only if it is typable and the types of all its arguments are inhabited. We complete the picture by providing an algorithm for the inhabitation problem of P.

cs.LO↗
arXiv2021

An algebraic theory of clones with an application to a question of Birkhoff and Maltsev

We introduce the notion of clone algebra, intended to found a one-sorted, purely algebraic theory of clones. Clone algebras are defined by true identities and thus form a variety in the sense of universal algebra. The most natural clone algebras, the ones the axioms are intended to characterise, are algebras of functions, called functional clone algebras. The universe of a functional clone algebra, called omega-clone, is a set of infinitary operations containing the projections and closed under finitary compositions. We show that there exists a bijective correspondence between clones (of finitary operations) and a suitable subclass of functional clone algebras, called block algebras. Given a clone, the corresponding block algebra is obtained by extending the operations of the clone by countably many dummy arguments. One of the main results of this paper is the general representation theorem, where it is shown that every clone algebra is isomorphic to a functional clone algebra. In another result of the paper we prove that the variety of clone algebras is generated by the class of block algebras. This implies that every omega-clone is algebraically generated by a suitable family of clones by using direct products, subalgebras and homomorphic images. We conclude the paper with two applications. In the first one, we use clone algebras to answer a classical question about the lattices of equational theories. The second application is to the study of the category VAR of all varieties. We introduce the category CA of all clone algebras (of arbitrary similarity type) with pure homomorphisms as arrows. We show that the category VAR is categorically isomorphic to a full subcategory of CA. We use this result to provide a generalisation of a classical theorem on independent varieties.

math.LO↗
arXiv2019

On noncommutative generalisations of Boolean algebras

Skew Boolean algebras (skew BA) and Boolean-like algebras (nBA) are one-pointed and n-pointed noncommutative generalisation of Boolean algebras, respectively. We show that any nBA is a cluster of n isomorphic right-handed skew BAs, axiomatised here as the variety of skew star algebras. The variety of skew star algebras is shown to be term equivalent to the variety of nBAs. We use skew BAs in order to develop a general theory of multideals for nBAs. We also provide a representation theorem for right-handed skew BAs in terms of nBAs of n-partitions.

math.LO↗
arXiv2018

Inhabitation for Non-idempotent Intersection Types

The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable or the strongly normalizing lambda-terms. We prove the decidability of the inhabitation problem for all the systems considered, by providing sound and complete inhabitation algorithms for them.

cs.LO↗
arXiv2013

Minimal lambda-theories by ultraproducts

A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there is a minimal lambda-theory represented by it. In this paper, we give a general tool to answer positively to this question and we apply it to a wide class of webbed models: the i-models. The method then applies also to graph models, Krivine models, coherent models and filter models. In particular, we build an i-model whose theory is the set of equations satisfied in all i-models.

cs.LO↗
arXiv2012

Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion

We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus. This calculus is related to Boudol's resource calculus and is derived from Ehrhard and Regnier's differential extension of Linear Logic and of the lambda calculus. We extend it with new constructions, to be understood as implementing a very simple exception mechanism, and with a "must" parallel composition. These new operations allow to associate a context of this calculus with any point of the model and to prove full abstraction for the finite sub-calculus where ordinary lambda calculus application is not allowed. The result is then extended to the full calculus by means of a Taylor Expansion formula. As an intermediate result we prove that the exception mechanism is not essential in the finite sub-calculus.

cs.LO↗
arXiv2011

Extensional Collapse Situations I: non-termination and unrecoverable errors

We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined form a lattice when ordered by the extensional collapse situation relation, introduced in order to compare models with respect to the amount of "intensional information" that they provide on computation. The proofs are carried out by exhibiting suitable applied λ-calculi, and by exploiting the fundamental lemma of logical relations.

cs.LO↗