pr4xis 0.28.0

Axiomatic Intelligence — an ontology + category-theory reasoning engine: every claim derived from explicit axioms, with a proof path back to them
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

//! Typed const-constructable handles into an ontology corpus.
//!
//! [`EntityRef`] is the build-time→runtime handle emitted by codegen and
//! consumed by ontology `from_codegen` functors. The phantom marker `P`
//! tags each handle with the ontology it belongs to, so handles from
//! different ontologies are distinct types at compile time but compile
//! to the same machine code (a single `u64`).
//!
//! Literature: typed-handle pattern is the standard way to express
//! ontology-distinct identity at the type level — see Spivak (2014)
//! *Category Theory for the Sciences* §3.1 on typed morphisms, and the
//! `Reference<N>` pattern already in pr4xis-domains.

use core::marker::PhantomData;

/// Typed const-constructable handle into an ontology corpus.
///
/// Phantom marker `P` distinguishes handles per ontology — `EntityRef<English>`
/// and `EntityRef<UsCode>` are distinct types at compile time but compile to
/// the same machine code (a single u64). Const-constructable so it can appear
/// directly inside `&'static [(EntityRef<P>, EntityRef<P>)]` static arrays
/// emitted by codegen.
///
/// Literature: typed-handle pattern is the standard way to express
/// ontology-distinct identity at the type level — see Spivak (2014)
/// *Category Theory for the Sciences* §3.1 on typed morphisms, and the
/// `Reference<N>` pattern already in pr4xis-domains.
#[derive(Debug)]
pub struct EntityRef<P> {
    value: u64,
    _phantom: PhantomData<P>,
}

// Manual impls so the trait bounds don't transitively require `P: Trait`.
// `PhantomData<P>` itself implements Copy/Clone/PartialEq/Eq/Hash
// unconditionally, but deriving on the outer struct would force `P` to
// satisfy each trait too. The marker `P` is purely a tag; never inspected.
impl<P> Clone for EntityRef<P> {
    fn clone(&self) -> Self {
        *self
    }
}

impl<P> Copy for EntityRef<P> {}

impl<P> PartialEq for EntityRef<P> {
    fn eq(&self, other: &Self) -> bool {
        self.value == other.value
    }
}

impl<P> Eq for EntityRef<P> {}

impl<P> core::hash::Hash for EntityRef<P> {
    fn hash<H: core::hash::Hasher>(&self, state: &mut H) {
        self.value.hash(state);
    }
}

impl<P> EntityRef<P> {
    /// Construct a new typed handle. `const` so it can appear in
    /// `static` arrays emitted by codegen.
    pub const fn new(value: u64) -> Self {
        Self {
            value,
            _phantom: PhantomData,
        }
    }

    /// The raw numeric value backing this handle.
    pub const fn value(&self) -> u64 {
        self.value
    }
}