Axioms and Decidability for Type Isomorphism in the Presence of Sums

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about polynomials with exponentiation that have not been used in our context, we derive: that the usual finite axiomatization known as High-School Identities (HSI) is complete for a significant subclass of types; that it is decidable for that subclass when two types are isomorphic; that, for the whole of the set of types, a recursive extension of the axioms of HSI exists that is complete; and that, for the whole of the set of types, the question as to whether two types are isomorphic is decidable when base types are to be interpreted as finite sets. We also point out certain related open problems

On Multi-Language Semantics: Semantic Models, Equational Logic, and Abstract Interpretation of Multi-Language Code

Modern software development rarely takes place within a single programming language. Often, programmers appeal to cross-language interoperability. Benefits are two-fold: exploitation of novel features of one language within another, and cross-language code reuse. For instance, HTML, CSS, and JavaScript yield a form of interoperability, working in conjunction to render webpages. Some object oriented languages have interoperability via a virtual machine host (.NET CLI compliant languages in the Common Language Runtime, and JVM compliant languages in the Java Virtual Machine). A high-level language can interact with a lower level one (Apple's Swift and Objective-C). Whilst this approach enables developers to benefit from the strengths of each base language, it comes at the price of a lack of clarity of formal properties of the new multi-language, mainly semantic specifications. Developing such properties is a key focus of this thesis. Indeed, while there has been some research exploring the interoperability mechanisms, there is little development of theoretical foundations. In this thesis, we broaden the boundary functions-based approach à la Matthews and Findler to propose an algebraic framework that provides systematic and more general ways to define multi-languages, regardless of the inherent nature of the underlying languages. The aim of this strand of research is to overcome the lack of a formal model in which to design the combination of languages. Main contributions are an initial algebra semantics and a categorical semantics for multi-languages. We then give ways in which interoperability can be reasoned about using equations over the blended language. Formally, multi-language equational logic is defined, within which one may deduce valid equations starting from a collection of axioms that postulate properties of the combined language. Thus, we have the notion of a multi-language theory and part of the thesis is devoted to exploring the properties of these theories. This is accomplished by way of both universal algebra and category theory, giving us a very general and flexible semantics, and hence a wide collection of models. Classifying categories are constructed, and hence equational theories furnish each categorical model with an internal language. From this we establish soundness and completeness of the multi-language equational logic. As regards static analysis, the heterogeneity of the multi-language context opens up new and unexplored scenarios. In this thesis, we provide a general theory for the combination of abstract interpretations of existing languages in order to gain an abstract semantics of multi-language programs. As a part of this general theory, we show that formal properties of interest of multi-language abstractions (e.g., soundness and completeness) boil down to the features of the interoperability mechanism that binds the underlying languages together. We extend many of the standard concepts of abstract interpretation to the framework of multi-languages. Finally, a minor contribution of the thesis concerns language specification formalisms. We prove that longstanding syntactical transformations between context-free grammars and algebraic signatures give rise to adjoint equivalences that preserve the abstract syntax of the generated terms. Thus, we have methods to move from context-free languages to the algebraic signature formalisms employed in the thesis

Residually small varieties and commutator theory.

Thesis (M.Sc.)-University of Natal, Durban, 2000.Chapter 0 In this introductory chapter, certain notational and terminological conventions are established and a summary given of background results that are needed in subsequent chapters. Chapter 1 In this chapter, the notion of a "weak conguence formula" [Tay72], [BB75] is introduced and used to characterize both subdirectly irreducible algebras and essential extensions. Special attention is paid to the role they play in varieties with definable principal congruences. The chapter focuses on residually small varieties; several of its results take their motivation from the so-called "Quackenbush Problem" and the "RS Conjecture". One of the main results presented gives nine equivalent characterizations of a residually small variety; it is largely due to W. Taylor. It is followed by several illustrative examples of residually small varieties. The connections between residual smallness and several other (mostly categorical) properties are also considered, e.g., absolute retracts, injectivity, congruence extensibility, transferability of injections and the existence of injective hulls. A result of Taylor that establishes a bound on the size of an injective hull is included. Chapter 2 Beginning with a proof of A. Day's Mal'cev-style characterization of congruence modular varieties [Day69] (incorporating H.-P. Gumm's "Shifting Lemma"), this chapter is a self-contained development of commutator theory in such varieties. We adopt the purely algebraic approach of R. Freese and R. McKenzie [FM87] but show that, in modular varieties, their notion of the commutator [α,β] of two congruences α and β of an algebra coincides with that introduced earlier by J. Hagemann and C. Herrmann [HH79] as well as with the geometric approach proposed by Gumm [Gum80a],[Gum83]. Basic properties of the commutator are established, such as that it behaves very well with respect to homomorphisms and sufficiently well in products and subalgebras. Various characterizations of the condition "(x, y) Є [α,β]” are proved. These results will be applied in the following chapters. We show how the theory manifests itself in groups (where it gives the familiar group theoretic commutator), rings, modules and congruence distributive varieties. Chapter 3 We define Abelian congruences, and Abelian and affine algebras. Abelian algebras are algebras A in which [A2, A2] = idA (where A2 and idA are the greatest and least congruences of A). We show that an affine algebra is polynomially equivalent to a module over a ring (and is Abelian). We give a proof that an Abelian algebra in a modular variety is affine; this is Herrmann's Funda- mental Theorem of Abelian Algebras [Her79]. Herrmann and Gumm [Gum78], [Gum80a] established that any modular variety has a so-called ternary "difference term" (a key ingredient of the Fundamental Theorem's proof). We derive some properties of such a term, the most significant being that its existence characterizes modular varieties. Chapter 4 An important result in this chapter (which is due to several authors) is the description of subdirectly irreducible algebras in a congruence modular variety. In the case of congruence distributive varieties, this theorem specializes to Jόnsson's Theorem. We consider some properties of a commutator identity (Cl) which is a necessary condition for a modular variety to be residually small. In the main result of the chapter we see that for a finite algebra A in a modular variety, the variety V(A) is residually small if and only if the subalgebras of A satisfy (Cl). This theorem of Freese and McKenzie also proves that a finitely generated congruence modular residually small variety has a finite residual bound, and it describes such a bound. Thus, within modular varieties, it proves the RS Conjecture. Conclusion The conclusion is a brief survey of further important results about residually small varieties, and includes mention of the recently disproved (general) RS Conjecture

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems