This paper introduces two novel metrics for assessing collaboration potential between programming paradigms and languages, ofering a fresh approach to evaluating inter-paradigm interactions. The quantitative framework introduced challenges traditional methods by highlighting both the opportunities and the challenges of integrating paradigms with varying characteristics. Initial findings suggest that the metric efectively captures collaboration within similar paradigms, with functional paradigms demonstrating particularly strong collaboration potential. However, it also underscores the complexity of unifying divergent paradigms. The goal of this paper is to provoke discussion and foster further research, such as the refinement of metrics to obtain useful measurements in technology selection steps and interdisciplinary software development.
(W. Vanhoof)
technical and syntactic aspects of the question [
CEUR ceur-ws.org
of paradigm.
on research objectives.
focusing on their underlying paradigms.
programming paradigms. In this section, we extend and refine his seminal taxonomy through the
somewhat specific lens of inter-language synergies and collaborations. The theoretical foundations of
interest in this pursuit have, in fact, been little investigated in the past; the main sources that we have
collected and selected through an extensive literature review are [
Our taxonomy is essentially embodied by an acyclic directed graph where each node corresponds to a distinct paradigm (Figure 1a), and each edge signifies the acquisition of a concept (Figure 1b) that makes a paradigm evolve into a more specialised form. We call the acquisition of specific concepts through such evolutionary paths conceptual hierarchy. The resulting structure allows incorporating the paradigms’ inherent concepts as well as their computable attributes such as Turing completeness (Figure 1c) and non-determinism observability (Figure 1d). These attributes allow categorising the paradigms into broader groups known as meta-paradigms (Figure 1e), which help to provide a macroscopic view of their relationships, according to the following definition.
by multiple paradigms. It conceptually regroups features that influence the models, design, and implementation of groups of paradigms. Transitions between meta-paradigms result from acquiring specific concepts, leading to shifts in focus and application.
archies, which can in some cases influence their compatibility predispositions. We call this specific relation propagation; see Figure 1f for concrete examples.
set of concepts, but acquired in diferent orders.
(a) (b) (c) (d) (e) (f) Figure 1: Fragments of the taxonomy. The grey-to-yellow gradient in (Figure 1c) indicates the shift from paradigms limited to data structures to those enabling Turing completeness.
In total, our proposed taxonomy includes 28 distinct paradigms defined by 17 key concepts and 2
observable binary characteristics and organised into 11 meta-paradigms. The whole graph is depicted
in Appendix A’s Figure 4, along with an exhaustive enumeration of the diferent constitutive sets
and an illustration of our approach (Table 1) in which we instantiate our framework on the so-called
”deterministic logic” paradigm. More information on the array of paradigms considered can also be
found online in the form of a poster [
Definition 3.1 = (, , , , , )
A programming paradigm, often denoted , is formally defined as a 6-tuple, i.e.
, where each element represents a specific dimension of the paradigm: • (⊆ Concepts) is the non-empty set of key concepts that define the paradigm. • (⊆ Paradigms) is the parent paradigms from which evolved. • (⊆ Paradigms) is the child paradigms descended from . • (∈ {0, 1}) is a Boolean indicating if all languages using can be Turing-complete. • (∈ {0, 1}) is a Boolean indicating if permits observable non-determinism. • (∈ Meta-paradigms) is the associated meta-paradigm.
Definition 3.2 The Inter-Paradigm Collaboration Metric (PCM ) ∶ Paradigms × Paradigms ↦ [
PCM ( 1, 2) = × ( 1, 2) + × (
+ × MP ( 1, 2) + × (
1, 2) + × (
1, 2) + × (
2, 1)
1, 2)
where , , , , , ∈ [
each weight is set to 1 to ensure equal contribution from the six factors, although future research may 6 adjust these values based on specific requirements.
shared concepts to the total number of concepts, and incarnated in the definition by the function IC ∶ ( Concepts) × ( Concepts) → ℝ defined by IC( 1, 2) = || 11∩∪ 22|| . This ratio helps determine how well paradigms complement each other.
parent paradigms of one and the child paradigms of the other. The notion is formalised by the function KR ∶ ( Paradigms) × ( Paradigms) ↦ {0, 1}where KR( , ) = 1 if and only if ∩ ≠ ∅ . Although
thus preventing PCM from requiring symmetry in each of its components. The compatibility of meta-paradigms is determined by a function MP Meta-paradigms ↦ {0, 1}such that MP ( 1, 2) = 1 ⇔ 1 = 2. ∶
We also check for Turing completeness with TC ∶ {0, 1}2 ↦ {0, 1}where TC( 1, 2) = 1 ∧ 2.
permit it, formally using the function OND ∶ {0, 1}2 ↦ {0, 1}such that OND( 1, 2) = 1 ∧ 2.
cusing on conceptual and computational alignment [
Interestingly, the functional paradigm (Figure 2a) demonstrates a high level of collaboration potential with many pairs, suggesting strong compatibility and deep integration possibilities. In contrast, the imperative paradigm (Figure 2b) shows more variability, with a balanced distribution between low and moderate collaboration potential, this time hinting that specialised approaches may be needed to achieve efective integration. As a last remark in this non-exhaustive analysis, we noticed that the deterministic logic paradigm (Figure 2c) shows strong collaboration potential within its own meta-paradigm (”constraints and logic”), but generally moderate compatibility outside of it, indicating a more selective capacity for integration. The whole dataset, modelled using Haskell, is accessible in an online repository1.
(a) for Functional (b) for Imperative (c) for Deterministic Logic
define its capabilities and behavioural characteristics. For a language named , the corresponding set is denoted by = { 1, 2, … , }, where each ( ∈ 1..) is a distinct paradigm (represented by its tuple) contributing to the language’s comprehensive functionality.
the definition above, we can now define a new metric LCM , which captures paradigmatic compatibility as well, but this time across languages. This metric operates on the combined paradigm sets of the languages while preserving the integrity of each paradigm, even if it appears in both sets. Definition 4.2 below formalises this approach. It uses an ordering relation, denoted by >, to compare the paradigms that are represented within the taxonomy. The first incarnation of the relation can be defined as follows. For two paradigms and ′, represented as tuples = ( 0, 1, … , −1 ) and ′ = ( 0, 1, … , −1 ), we define the order as ′ > ⇔ (∃ ∈ {0, 1, … , min(, ) − 1 }| = ∀ < ∧ < ) ∨ ( < ∧ = ∀ < ) 1See https://github.com/Vdloisem/MCC.
Definition 4.2 Let and be the sets of programming paradigms associated, respectively, with the programming languages named and . Let be the multiset ⊕ , i.e. the ordered concatenation of and using the relation > defined above. The Inter-Language Collaboration
LCM ( , ) = 1 ∑ PCM (, ′) ( ) 2 (, ′)∈ where = {(, ′)|, ′ ∈ , ′ > } and = || .
The process described in Definition 4.2 provides a structured framework to analyse collaboration
between and , ofering preliminary insights into language selection, comparative analysis, and
paradigm interaction (see Figure 3). The dotted lines (also present in Figure 2) mark a notion of
”collaboration levels”, based on confidence intervals derived from the distribution of collaboration
scores. For a more comprehensive overview, including a more thorough explanation regarding the
collaboration levels, see [
(a) Fuctional language (b) Imperative language (c) Deterministic Logic Language
This research has laid the groundwork for evaluating collaboration between programming paradigms based on the adaptation of an existing taxonomy in that context. Our findings suggest that functional paradigms and, by extension, the languages that incorporate them, show stronger indicators of collaboration potential. This kind of insight is especially valuable for software engineers that need to make informed decisions during the architecture and design phases of system development, as it ofers a quantitative basis for selecting paradigms that can work together more efectively. Although the metrics show promise, for now, they primarily focus on static characteristics and do not fully capture the broader concerns of language interoperability as (complex) systems grow and evolve. Future work will aim to explore deeper inter-paradigmatic interactions and refine the metrics, with a focus on expanding the framework to support more languages and paradigms while assessing its practical relevance through qualitative studies. These will examine developers’ language selection based on familiarity, community support, and domain-specific constraints. Additionally, we plan to develop tools for multi-language integration in development environments, potentially automating early-stage software decisions. To enhance comprehensiveness, we will incorporate factors such as typing, compilation, and memory management into our metrics. Real-world case studies will further refine these metrics, formalize interoperability and collaboration, and help determine optimal collaboration weights depending on application contexts. Finally, we will explore assigning weights to each paradigm within a language and integrating them into LCM to better capture their relative influence. These eforts should refine our proof of concept and support more complete and efective analyses of software development strategies in various programming environments.
Paradigms Concepts
descriptive declarative, first-order functional, functional, imperative, deterministic logic , ⎧⎪ lazy functional, continuation, adt functional, event loop, stateful functional, ⎪ guarded command, imperative search, sequential object oriented, relational and logic, ⎪ declarative concurrent, adt imperative, multi agent, active object, = ⎨ shared state concurrent, concurrent object oriented, constraint logic, ⎪ concurrent constraint, lazy declarative concurrent, nonmonotonic dataflow , ⎪⎪ multi agent dataflow, continuous synchronous, lazy concurrent constraint , ⎩ discrete synchronous ⎫ ⎪ ⎪ ⎪ ⎬ ⎪ ⎪ ⎪ ⎭ record, procedure, closure, unification, cell, search, solver, thread, by-need sync , = { continuation, unforgeable constant, channel, single assign, nondet choice, sync on partial termination, clocked computation, local cell }
Binary characteristics = { Turing completeness, observable non-determinism } Meta-paradigms
functional, shared state, logic and constraint, data abstraction, message passing, = { concurrent dataflow, algorithmic search, constrained execution, reactive , dataflow and message passing, functional concurrent dataflow }
Figure 4: Taxonomy of programming paradigms