dol 0.8.1

DOL (Design Ontology Language) - A declarative specification language for ontology-first development
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

// Effect System Test: Pure Basic Functions
// =========================================
//
// What this test validates:
//   - Basic pure functions with no side effects are correctly inferred as pure
//   - Arithmetic operations maintain purity
//   - Functions that only transform inputs to outputs without external interaction
//
// Expected effect inference results:
//   - add(a, b) -> Pure
//   - multiply(a, b) -> Pure
//   - negate(x) -> Pure
//   - double(x) -> Pure
//   - increment(x) -> Pure

gene Math.Pure @0.1.0 {
    """
    Basic pure mathematical operations.
    All functions are deterministic and have no side effects.
    """

    // Pure: takes two numbers, returns their sum
    // No I/O, no mutation, no messaging
    fn add(a: Int, b: Int) -> Int {
        a + b
    }

    // Pure: takes two numbers, returns their product
    fn multiply(a: Int, b: Int) -> Int {
        a * b
    }

    // Pure: negates a number
    fn negate(x: Int) -> Int {
        -x
    }

    // Pure: doubles a number (uses only local computation)
    fn double(x: Int) -> Int {
        x + x
    }

    // Pure: increments by one
    fn increment(x: Int) -> Int {
        x + 1
    }
}

// Test assertions for effect inference
test effects {
    assert_pure(Math.Pure.add);
    assert_pure(Math.Pure.multiply);
    assert_pure(Math.Pure.negate);
    assert_pure(Math.Pure.double);
    assert_pure(Math.Pure.increment);
}