https://orcid.org/0000-0002-2680-5013
Figures
Abstract
This paper explores the introduction of group structures within type theory, drawing from the algebraic theory proposed by Roy L. Crole. We define types with group structures and demonstrate that models of these types in categories with finite products can be interpreted as group objects. Each equation within the context of group theory types corresponds to a commutative diagram, representing the axioms of groups, inspired by Lawvere’s functorial semantics. Moreover, we clarify the role of control equations associated with fundamental properties of groups, such as operations and identities. By formalizing a type referred to as “Group Type," which involves integrating group operations and the equations they satisfy into an algebraic type, we incorporate the algebraic structure of a specific group into this type. This Group Type represents a concrete algebraic structure. In practical applications, the introduction of group structures into types is anticipated to optimize algorithms and data structures, leveraging the algebraic properties of groups to enhance computational efficiency. Furthermore, our exploration is not limited to mathematical conversions; it is also envisioned to extend to the application in various type systems, providing support for future research in formal verification and program analysis in computer science.
Citation: Tang J-G, Aishan Y, Liu J-Y, Peng J-Y (2025) Research on group type theory and its functorial semantic models in category logic. PLoS One 20(6): e0326301. https://doi.org/10.1371/journal.pone.0326301
Editor: Fucai Lin, Minnan Normal University, CHINA
Received: February 4, 2024; Accepted: May 27, 2025; Published: June 24, 2025
Copyright: © 2025 Tang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: All data and definitions cited in this paper are referenced appropriately, allowing for easy access to the original sources. The specific details are as follows: For the definitions from the reference [9] Crole, R. L. (1995), the following three definitions are included: the Definition of Algebraic Type Theory, the Definition of the Structure of Algebraic Type Theory, and the Definition of Models of Algebraic Type Theory. These definitions are thoroughly cited within the text. Regarding the definition of Group Objects in a Category from the reference [21] Pfeiffer, H. (2007), as well as the three accompanying diagrams — “Group objects satisfy the commutative diagram of morphisms with the property of the commutative law,” “Group objects satisfy the commutative diagram of morphisms with the property of inverse elements,” and “Group objects satisfy the commutative diagram of morphisms with the property of identity element” — these contents are publicly available and can be found in related literature on the concept of group objects. All data used in this study is derived from the following fully publicly available sources: Crole, R. L. (1995). Categorical Logic and Type Theory. New York: Oxford University Press. Pfeiffer, H. (2007). “2-Groups, Trialgebras, and Their Hopf Categories of Representations,” Advances in Mathematics, Vol. 212, pp. 62-108. DOI: 10.1016/j.aim.2006.09.014.
Funding: The University Key Project of Natural Science of Xinjiang Uygur Autonomous Region (Grant No. XJEDU2019I024); National Nature Science Foundation of China (Grant No. 11161050, 31240020).
Competing interests: The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Introduction
Type theory was first introduced by Russell and Church, who emphasized the necessity of types to resolve logical paradoxes [2,3]. In 1940, Church developed a framework for simple type theory, laying the groundwork for subsequent research [1]. This theory has become a key tool for understanding computation and logic, providing a theoretical foundation for addressing logical challenges.
In modern logic, type theory based on category theory is evolving into a new unified foundation for contemporary mathematics. Categorical logic originated from Lawvere’s Functorial Semantics of Algebraic Theories [4] and the Elementary Theory of the Category of Sets [5]. Broadly speaking, categorical logic represents syntax and semantics through categories, while interpretations are conveyed through functors. In the realm of theoretical computer science, categorical logic and type theory find a wide range of applications in functional programming languages, program semantics, and program logic.
As an extension and development of category theory, mathematical logic, and programming, categorical logic and type theory have seen rapid advancements in recent years. Lawvere [6] provided insights into the relationship between logic and layers. Makkai and Reyes [7] introduced and studied first-order categorical logic. Lambek and Scott [8] made significant contributions by introducing higher-dimensional categorical logic. Andrew M. Pitts [19] further developed the theory of categorical logic. Bart Jacobs [20] systematically summarized the research achievements in the domains of categorical logic and type theory. Lastly, John Baez and Mike Stay [22] explored connections among physics, topology, logic, and computation within the framework of category theory.
Roy L. Crole’s book [9] explores the relationship between category theory, logic, and type theory, focusing on several key aspects. He provides a detailed introduction to the foundational concepts of category theory, including objects, morphisms, and the relationships between categories, as well as their applications in logic and computational theory. Additionally, he examines logical systems from a categorical perspective, analyzing how different logical systems can be described using categorical language. Crole also investigates the structure of type theory, emphasizing its significance in programming languages and computer science. He discusses the interplay between logic, type theory, and category theory, illustrating how these fields influence and enhance one another. Furthermore, he offers multiple examples that demonstrate the application of these theories in the design and analysis of actual programming languages and systems. Overall, Crole’s research provides important insights into the profound connections among these domains, holding significant implications for both academic research and practical applications.
With the development of programming languages, type theory’s applications in computer science have become increasingly widespread. Milner proposed a theory of type polymorphism, establishing the foundation for functional programming languages [10]. Pierce’s book “Types and Programming Languages" systematically summarizes various concepts of type systems [11].
In program development, interactive theorem proving tools such as Coq and Lean have become important research directions. Bertot and Castran’s book provides a detailed introduction to using Coq for program development [12]. The Lean user guide offers practical tools and resources for users [13].
In recent years, research on the semantics of probabilistic programming languages has gradually emerged. Kozen explored the semantics and reasoning of probabilistic programs in his works [14,15]. Jia and colleagues proposed research on commutative monads for probabilistic programming languages, filling a gap in this field [16].
In the context of quantum computing, Jia and colleagues researched the semantics of variational quantum programming, advancing the theoretical development of quantum programming languages [17]. Additionally, Goubault-Larrecq and colleagues proposed a domain-theoretic approach to explore issues related to statistical programming languages [18].
The applications of type theory and categorical logic in programming languages, as well as the research advances in probabilistic and quantum programming, have greatly enriched the theoretical framework and provided new tools and ideas for practical applications. This opens up new perspectives for us to further explore the intersection and integration of these theories and their applications in emerging technologies.
The theoretical foundation of programming languages is rooted in categorical logic. In this paper, we approach the introduction of group structures within the type system from a syntactic perspective, specifically defining types with group structures based on the algebraic theory proposed by Roy L. Crole. From a semantic standpoint, we demonstrate that the models of group structure types in categories with finite products can be interpreted as group objects. Within the context of group theory types, each equation corresponds to a commutative diagram associated with the group object in the semantic category, and each commutative diagram represents an axiom of the group. This approach also draws inspiration from Lawvere’s concept of functorial semantics of categories. Specifically, the model in the category of sets corresponds to a classical group, while the model in n-dimensional manifolds is associated with Lie groups.
When referencing control equations in the context of group theory types, it is important to clarify the name, meaning, and role of each equation within the theory. Examples of control equations and their citation methods typically involve fundamental properties of groups, such as group operations, commutativity, identity elements, and inverse elements.
The type system provides a formal mathematical foundation for expressing and managing complex structures. By introducing group structures in type theory, we can more accurately model the basic properties of groups, including group operations, identity elements, and inverse elements. By defining a type called ‘Group‘, which includes the elements of the group, operations, and verification of related properties, we can ensure that the group structures used in program design conform to mathematical definitions while also enhancing the clarity and maintainability of the code. Furthermore, directly integrating the properties of groups into the definition of types helps to automatically verify group characteristics in programs, ensuring compliance with group theory requirements.
In program design, the introduction of group structures can assist in solving many complex problems. For instance, many algorithms and data structures (such as hash tables and cryptographic algorithms) can be optimized by leveraging the properties of groups. By applying group structures in design, we can utilize the symmetry and algebraic properties of groups to enhance computational efficiency, resulting in more effective and reliable solutions.
In terms of theoretical groundwork, researching how to introduce group structures in types is not limited to the conversion of mathematical formulas but also necessitates exploring applications in different types of systems (such as dependent type systems and modal type systems). This in-depth theoretical research will lay the foundation for the application of group theory in computer science, such as formal verification and program analysis.
Preliminaries
Currently, various formulations of type theory can be found in the literature. This paper adopts a simplified version of the algebraic type theory proposed by Roy L. Crole [9]. In this algebraic type theory, we introduce operations and equations with a group structure, which is one of the distinctive features of this work, this algebraic type theory is referred to as “Group Type Theory." This approach can also be applied to the study of more complex algebraic type theories.
The first step is to introduce a simplified version of the algebraic type theory concept proposed by Roy L. Crole [9].
[9] An algebraic type theory
consists of the following components:
where Sg includes:
(1) Types: ;
(2) Function symbols: , where
, when n is zero, f is called a constant function symbol, and is denoted as
;
(3) The formation rules for initial terms:
In other words:
1. A variable is a term;
2. A constant is a term;
3. If are terms, then
is a term, where
.
(4) The formation rules for proven terms:
Among them, is called the context, usually denoted as
, where
are different variables, and
are types. A form like
is called a term under the context, where M is the original term. Given Sg, a proven term is a term under the context generated by the above rules and is denoted as
.
The class of equations under the context about Sg is denoted as Ax, where an equation under the context has the form , here,
and
are proven terms. An equation under the context in Ax is called an axiom of this theory and is denoted as
.
(5) The theorems of (having the form
) are produced by the following rules:
(where
is a permutation)
(where
)
This paper now introduces equations with a group structure based on a simplified algebraic type theory proposed by Roy L. Crole, which we refer to as “group type theory."
Definition 2.2 A group type theory has:
(1) A type ;
(2) Function symbols: ,
,
;
(3) The formation rules for initial terms:
(4) The rules for generating proven terms:
(5) The equations under the context, which are axioms, are:
Theorem generation rules are consistent with the generation rules of algebraic type theory.
Functorial semantic models of group type theory
In this section, we will introduce functorial semantic models of group type theory. To this end, we first present the concept of an interpretation (or structure) of a general algebraic type theory in a category with finite products, as defined by Roy L. Crole. In this paper, we only require the categories related to functorial semantics to have finite products, whereas in the study of more complex type theories, the categories involved in functorial semantics typically need to have Cartesian closedness.
Definition 3.1 [9] Let be an algebraic type theory and
be a category with finite products. An interpretation (or structure) M of Sg in
, satisfies:
(1) The types in Sg are objects
in
;
(2) The function symbols in Sg are morphisms
in
;
(3) The constant function symbols in Sg are morphisms
in
, where 1 is the terminal object in
.
Note 3.1 For each proven term of the algebraic type theory , we define
in
as a morphism, where
is the context and
Thus, we obtain:
We now introduce the concept of a model of a general algebraic type theory in a category with finite products, as defined by Roy L. Crole.
Definition 3.2. [9] Let be an algebraic type theory and
a category with finite products. An interpretation M of Sg in
, for an equation
under the context, if M makes
and
equal morphisms in
, then we say that M satisfies this equation under the context. If M satisfies all equations under the context in Ax, then we call M a model of the algebraic type theory
.
We will now introduce the concept of group objects in categories with finite products.
[21] Let
be a category with finite products, and let
,
,
,
be morphisms such that the following diagrams commute (Fig 1):
Existence of a unit e:
Existence of inverses (Fig 2):
Associativity of m (Fig 3):
Then is called a group object in the category
.
Note 3.2 The provided definitions are describing a group object in a category with finite products. The first diagram represents the associativity of the multiplication, the second one shows the existence of a unit (or identity element), and the third one demonstrates the existence of inverses for each element in G.
Lemma 3.1. [9] The structure of a group type theory in a category
with finite products is as follows: types are objects in the category
; proven items are morphisms between objects in
.
Specifically:
Note 3.3 For convenience in writing, we will abbreviate ,
,
, and
.
We will now discuss models of group type theory in a general category with finite products.
Theorem 3.1 A model of the group type theory in the category
with finite products is a group object in the category
.
Proof. We will begin with equations (a) and (b) from Definition 2.2 and, based on the interpretations of types, function symbols, and equations as provided in Definitions 3.1 and 3.2, demonstrate the validity of the commutative diagram 1 stated in Definition 3.3.
From the interpretation of the proven items and axiom , we know that
,
As shown in the following diagram (Fig 4):
By the universal property of the product, we have and
.
Therefore, we obtain .
In the following diagram (Fig 5):
By the universal property of the product, we know that .
Because and similarly,
. Thus, all small triangles in the diagram below exchange (Fig 6).
Hence, . Similarly,
.
From the above discussion, we know that , then
. That is, the diagram below exchanges (Fig 7):
Similarly, we can prove that the diagram below also exchanges (Fig 8):
That is .
Secondly, we will begin with equations (c) and (d) from Definition 2.2 and prove the validity of commutative diagram 2 as stated in Definition 3.3.
By the interpretation of the proven items and axiom , we know that
(Fig 9).
Because , and because 1 is a terminal object, we can get
, then
, then we can get
. That is, the diagram below exchanges (Fig 10):
Similarly, the diagram below also exchanges (Fig 11):
Finally, we will start with equation (e) from Definition 2.2 and demonstrate the validity of commutative diagram 3 as described in Definition 3.3.
By the interpretation of the proven items and axiom , we know that
,
,
,
,
, where
. Then
, then we can get
.
That is, the diagram below exchanges (Fig 12):
In summary, the Functorial semantic model of the group type theory in a category
with finite products satisfies all the conditions for a group object as stated in Definition 3.3. Therefore, the Functorial semantic model of the group type theory
is a group object in the category
.
Models of the group type theory 
in concrete categories
Theorem 4.1. Let be the group type theory. A model of the group type theory in the category of sets
is a standard group
, where
, and the mappings
,
, and
satisfy the following properties:
- Closure: For all
, the product
.
- Associativity: For all
, it holds that
.
- Existence of Identity: There exists an element
such that for all
,
and
.
- Invertibility: For each
, there exists an element
denoted as
such that
and
.
Thus, the structure forms a group under the operation defined by m.
We will explain in detail that the group type theory has a model in the category of sets
, which is a group object in the category
.
Proof. For convenience in notation, we will abbreviate ,
,
, and
. Since T is a singleton set, we can assume without loss of generality that T = {e}. The definition in the model category
can be interpreted as follows:
(1) A type can be interpreted as a non– empty set G.
(2) The function symbols ,
, and
can be interpreted as mappings
,
, and
, representing the constant mapping, inverse mapping, and product mapping, respectively.
(3) The formation rules for initial terms are expressed as follows:
These can be interpreted in the model category as follows: the variable x belongs to G, the constant e belongs to G; if the terms M1 and M2 belong to G, then the term
also belongs to G, and
likewise belongs to G.
(4) The rules for generating proven terms are given by:
These can be interpreted in as follows: the first rule states that if x has type
, then it is an element of G. The second rule states that e has type
, meaning
. The third rule indicates that if M1 and M2 have type
, then the term
also has type
, thus
. The fourth rule states that if M has type
, then
has type
as well, which implies
.
(5) The axioms under the context are as follows:
The axioms (equations) can be interpreted as follows:
(a) This axiom states that for any element x of type sigma and the identity element e, the operation yields x, thus demonstrating the left identity property.
(b) Similarly, this axiom asserts that for any element x of type sigma and the identity element e, the operation also yields x, illustrating the right identity property.
(c) This axiom indicates that for any element x of type , the result of the operation
equals e, which shows that
is indeed the inverse of x.
(d) This axiom shows that for any element x of type , the operation
also equals e, confirming that
serves as the inverse of x.
(e) Finally, this axiom states that for any elements x, y, and z of type , the operation
is equal to
, thereby demonstrating the associativity of the operation m.
Thus, satisfies the three commutative diagrams specified in Definition 3.3, indicating that
is a group object in the category of sets
. Therefore, the interpretation of group theory
in this context is a group object in the category of sets
.
Definition 4.1 Let G be a group equipped with a topology. If the topology on G renders the group multiplication operation and the inversion operation
continuous, where
carries the product topology, then G is called a topological group.
Theorem 4.2 The category of topological spaces models the group theory
as topological groups.
Proof: By Theorem 3.1, the model of the group theory in the category of topological spaces
is the group object
in
, which ensures that i and m are continuous functions. Moreover, the definition of the group object
sustains the multiplication operation
and the inversion operation
. Therefore, the group theory
in the category of topological spaces
models as topological groups.
Definition 4.2 [13] Let be a group, and let
be a partial order on G. For any
, if
implies both
and
, then
is called an ordered group.
Theorem 4.3 The group theory in the category of partially ordered sets
is an ordered group.
Proof: By Theorem 3.1, we know that the model of group theory in the category of partially ordered sets
is the group object
within
, which implies that i and m are monotone mappings. Moreover, from the definition of the group object
, G is a group such that for any
, if
, then
, and thus
and
. Therefore, the group theory
in the category of partially ordered sets
is an ordered group.
Definition 4.3 Let X be a topological space, and let be a functor. If F satisfies that for any open set
and any open cover
,
, such that the following diagram is an equalizer diagram, then F is called a sheaf on the topological space X.
Here, ,
, and
.
Note: For any two sheaves F and G on a topological space X, a morphism between F and G is a natural transformation . Hence, we can form the full subcategory
of the functor category
, whose objects are all sheaves on the topological space X.
Theorem 4.4 The model of group theory in the category of sheaves
is a group sheaf.
Proof: By Theorem 3.1, the model of group theory in the category of sheaves
is a group object
within
. It follows that G is a sheaf and satisfies the commutative diagrams as per Definition 3.3. Therefore, for any open set U,
is a group and hence
constitutes a group sheaf. Consequently, the model of group theory
in the category of sheaves
is a group sheaf.
Note 4.2 From the above theorem, we realize that using the model of group theory in categories with finite products, we can define concepts like topological groups, ordered groups, and group sheaves, thus unifying the concepts of topological groups, ordered groups, and group sheaves.
Definition 4.4 A Lie group is a mathematical object that has both a smooth structure and a group structure. Specifically, a Lie group is defined as follows:
A Lie group G is a manifold that satisfies the following conditions:
1. Group Structure: There are two operations defined on G: - A multiplication map such that
. - An inverse map
such that i(g) = g−1.
These operations satisfy the group axioms: associativity, identity element existence, and inverse element existence.
2. Smooth Structure: The multiplication map m and the inverse map i are both smooth functions (i.e., infinitely differentiable).
Thus, a Lie group is not only an algebraic structure but also a smooth manifold, allowing the use of differential geometry to study its properties.
Theorem 4.5. The models of group type theory in the category of n-dimensional smooth manifolds form a Lie group.
Proof. To show that the models of group type theory in the category of n-dimensional smooth manifolds form a Lie group, we need to verify two main properties:
1. Group Structure: We need to define the group operations on these models. Let G be the model of the group type. The group operation can be defined via the composition of morphisms corresponding to the group operation in the theory. The identity element can be defined by an appropriate morphism in the category.
The inverse operation is similarly defined through the morphisms that correspond to the inversion in the group theory.
2. Smooth Structure: Since G is a model in the category of n-dimensional smooth manifolds, we can endow G with a smooth structure. The operations m and i can be shown to be smooth. This follows from the fact that composition of smooth maps is smooth and the structure of the category ensures that the operations respect the smooth manifold structure.
Combining these two points, we conclude that G satisfies the properties of a Lie group. Therefore, the models of group type theory in the category of n-dimensional smooth manifolds indeed form a Lie group.
Finally, based on the above research, we can obtain the following deeper results.
We can define the notion of a topological group as a group object in and a commutative Hopf C*– algebra as a group object in
.
Definition 4.5. Let be a category with finite coproducts. We define,
and call the objects of CoGrp cogroup objects in
and the morphisms internal cogroup homomorphisms in
.
Definition 4.6. The objects of the category
are called compact topological groups. The objects of
are called commutative Hopf C*-algebras.
Theorem 4.6. There is an equivalence of categories,
provided by the functors,
and
Discussion
Type theory is profoundly connected to programming languages, particularly in the handling of variables, constants, and functions, where the underlying mathematical structures are often algebraic structures. Algebraic structures provide a theoretical foundation for computation, and group structures, as one of the most fundamental algebraic structures, offer powerful tools for understanding and analyzing various computational processes.
Integrating group structures into type theory, forming “Group Theory in Types,” represents an important and meaningful research direction. Group theory not only aids in understanding symmetry and structure but also provides a foundational framework for addressing many theoretical problems in computer science. By incorporating group structures into type theory, we can more effectively describe and analyze the various symmetries and transformations that occur during computation.
The different interpretations of group type theory reflect its applications within the framework of model categories:
In the category of sets , group objects can be viewed as standard sets, where the properties of group operations and identity elements are satisfied within the context of sets, providing an intuitive understanding of the fundamental properties of groups. In the category of topological spaces, group objects are interpreted as continuous groups, emphasizing the continuity of group operations within the topological structure, which allows us to study the geometric properties of groups and their applications in continuous transformations. In the category of n-manifolds, group objects can be understood as Lie groups, which are groups defined on smooth manifolds, particularly relevant for addressing differential structures, especially in the study of symmetries and conservation laws in physics. In the category of sheaves, group objects are viewed as group sheaves, enabling us to handle group structures at a more granular level, particularly in cases involving discontinuous or layered structures. In the category of groups, the interpretation of group objects as 2-groups extends the concept of groups, allowing us to explore the properties and behaviors of groups within higher categorical theories.
In summary, the introduction of group structures into type theory not only enriches the content of type theory but also fosters a deeper connection between computer science and algebraic structures. This interdisciplinary research enhances our understanding of computational processes and provides theoretical support for the design and implementation of programming languages.
In the research on programming language theory, the anticipated outcomes of integrating group theory and related algebraic structures are primarily reflected in several aspects:
- Type Safety and Program Verification: By integrating the properties of group objects into type systems, we can enhance type safety mechanisms to effectively prevent type errors and verify algebraic properties during program execution, thereby improving the reliability and correctness of programs.
- Formal Verification and Model Checking: Utilizing tools from group theory provides new perspectives for the formal verification of programs. By mapping program behaviors to group properties, we can develop effective model checking algorithms to automatically verify invariants and symmetries in programs, thus enhancing software quality.
- Symmetry in Concurrency and Distributed Computing: Incorporating group structures in concurrent and distributed computing helps describe coordination and communication between computational nodes, simplifying system design and implementation while addressing consistency issues in distributed systems.
- Extension and Optimization of Type Systems: Leveraging group structures to develop new type systems enhances the expressive power of languages and allows for optimizations at compile time, making the generated code more efficient, particularly in computations related to symmetry.
- Promotion of Interdisciplinary Research: The integration of group theory with programming languages promotes interdisciplinary research between computer science, mathematics, and related fields, inspiring new research ideas and applications, and advancing areas such as quantum computing, cryptography, and artificial intelligence.
Through this research, the application of group theory within programming language theory can provide new tools and methods for scientific inquiry, driving innovation and progress in related fields.
Conclusion
In this paper, we presented a comprehensive examination of the integration of group structures within type theory, highlighting both the syntactic and semantic dimensions of this endeavor. By defining types that encapsulate group structures based on the algebraic theory established by Roy L. Crole, we have established a formal framework that aligns closely with the principles of categorical logic. This approach allows for a robust representation of group properties, facilitating the accurate modeling of fundamental operations such as group multiplication, identity elements, and inverses.
We demonstrated that group structures in our proposed type system can be interpreted as group objects within categories possessing finite products, thereby enriching the semantic landscape of type theory. Each equation within the context of group theory types translates into a commutative diagram, reflecting the axiomatic nature of groups. This correspondence not only reinforces the logical coherence of the theory but also serves as a foundation for practical applications in programming languages, enhancing their expressiveness and reliability.
Furthermore, the incorporation of group structures into type systems offers significant advantages in program design and development. By leveraging the algebraic properties of groups, we can optimize algorithms and data structures, leading to more efficient computational solutions. This intersection of theoretical foundations and practical implementation underscores the potential of group theory to address complex challenges in computer science.
As we conclude, it is essential to recognize that the exploration of group structures in type theory is a stepping stone towards deeper investigations into various dependent and modal type systems. The theoretical insights gained from this research pave the way for further studies in formal verification, program analysis, and the design of advanced programming languages. Future work will focus on expanding these concepts and applying them to emerging technologies, thereby enriching the theoretical underpinnings of computation and fostering innovations in software development.
In summary, this research not only contributes to the understanding of the interplay between type theory and group theory but also lays the groundwork for future explorations of their applications in computer science, promising to enhance both academic inquiry and practical implementations in the field.
Acknowledgments
I would like to express my heartfelt gratitude to all those who have provided support and assistance throughout the completion of this research. I extend a special thanks to the two reviewers for their thorough evaluation and invaluable feedback on this manuscript, which have significantly enhanced the quality of the research.
I also want to acknowledge all the members of our research group for their collaborative spirit and inspiring discussions. The diverse perspectives shared by everyone have enriched my understanding of the research topic and encouraged me to delve deeper into the subject matter.
Additionally, I am grateful to Sichuan University Jinjiang College, Kashgar University, and Ylli Normal University for their support and assistance in this research, providing an excellent academic environment and essential resources.
Finally, I appreciate everyone who has contributed to this research process. Your support and encouragement have strengthened my resolve on the academic journey and facilitated my growth and progress.
References
- 1. Church A. A formulation of the simple theory of types. J Symbol Logic. 1940;5(2):56–68.
- 2.
Russell B. Letter to Frege. In: van Heijenort J, editor. 1902. p. 124–5.
- 3.
Russell B. Mathematical logic as based on the theory of types. Whitehead AN, Russell B, editors. Cambridge University Press. 1910.
- 4. Lawvere FW. Functorial semantics of algebraic theories. Proc Natl Acad Sci. 1963;50(5):869–72.
- 5. Lawvere FW. Elementary theory of the category of sets. Proc Natl Acad Sci. 1964;52(6):1506–11.
- 6.
Lawvere FW. Quantifiers and Sheaves. In: Actes du Congre’s International des Mathematiciens. Nice; 1970. p. 329–34.
- 7.
Makkai M, Reyes G. First order categorical logic. Berlin: Springer. 1977.
- 8.
Lambek J, Scott PJ. Higher order categorical logic. Cambridge: Cambridge University Press. 1986.
- 9.
Crole RL. Categorical logic and type theory. New York: Oxford University Press. 1995.
- 10. Milner R. A theory of type polymorphism in programming. J Comput Syst Sci. 1978;17(3):348–75.
- 11.
Pierce BC. Types and programming languages. MIT Press. 2002.
- 12.
Bertot Y, Casteran P. Interactive theorem proving and program development: Coq’art: the C programming language. Springer. 2004.
- 13. The Lean Community. The lean user guide. 2021. https://leanprover.github.io/lean4/doc/lean4-user-guide/
- 14. Kozen D. Semantics of probabilistic programs. J Comput Syst Sci. 1981.
- 15. Kozen D. A probabilistic PDL. J Comput Syst Sci. 1985;30(2):162–78.
- 16.
Jia X, Lindenhovius B, Mislove M, Zamdzhiev V. Commutative monads for probabilistic programming languages. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS2021).
- 17. Jia X, Kornell A, Lindenhovius B, Mislove M, Zamdzhiev V. Semantics for variational quantum programming. Proc ACM Program Lang. 2022;6(POPL):Article 26.
- 18. Goubault-Larrecq J, Jia X, The´ron C. A domain-theoretic approach to statistical programming languages. J ACM. 2023;70(5):35.
- 19.
Pitts AM. Categorical logic. Handbook of logic in computer science. New York: Oxford University Press. 1995.
- 20.
Jacobs B. Categorical logic and type theory. Netherlands: Elsevier Science B.V.. 1999.
- 21. Pfeiffer H. 2-groups, trialgebras, and their Hopf categories of representations. Adv Math. 2007;212:62–108.
- 22.
Baez JC, Stay M. Physics, topology, logic and computation: a rosetta stone. Lecture notes in physics. Berlin: Springer. 2011. p. 95–174.