summaryrefslogtreecommitdiff
path: root/src/kompsos-prelude.adb
blob: 6cb8b2b5163e72ce9ac21de6d4b4c7ef3b7cad56 (plain)
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104


--  Programmed by Jedidiah Barber
--  Licensed under the Sunset License v1.0

--  See license.txt for further details


package body Kompsos.Prelude is


    function Head
           (This                 : in World;
            Full_List, Head_Term : in Term'Class)
        return World is
    begin
        return Result : World := This do
            Result.Unify (T (Head_Term & T (Result.Fresh)), Full_List);
        end return;
    end Head;

    procedure Head
           (This                 : in out World;
            Full_List, Head_Term : in     Term'Class) is
    begin
        This := Head (This, Full_List, Head_Term);
    end Head;


    function Tail
           (This                 : in World;
            Full_List, Tail_Term : in Term'Class)
        return World is
    begin
        return Result : World := This do
            Result.Unify (T (T (Result.Fresh) & Tail_Term), Full_List);
        end return;
    end Tail;

    procedure Tail
           (This                 : in out World;
            Full_List, Tail_Term : in     Term'Class) is
    begin
        This := Tail (This, Full_List, Tail_Term);
    end Tail;


    function Cons
           (This                            : in World;
            Head_Term, Tail_Term, Full_List : in Term'Class)
        return World is
    begin
        return Result : World := This do
            Result.Unify (T (Head_Term & Tail_Term), Full_List);
        end return;
    end Cons;

    procedure Cons
           (This                            : in out World;
            Head_Term, Tail_Term, Full_List : in     Term'Class) is
    begin
        This := Cons (This, Head_Term, Tail_Term, Full_List);
    end Cons;


    function Nil
           (This     : in World;
            Nil_Term : in Term'Class)
        return World is
    begin
        return Result : World := This do
            Result.Unify (Null_Term, Nil_Term);
        end return;
    end Nil;

    procedure Nil
           (This     : in out World;
            Nil_Term : in     Term'Class) is
    begin
        This := Nil (This, Nil_Term);
    end Nil;


    function Pair
           (This      : in World;
            Pair_Term : in Term'Class)
        return World is
    begin
        return Result : World := This do
            Result.Unify (T (T (Result.Fresh), T (Result.Fresh)), Pair_Term);
        end return;
    end Pair;

    procedure Pair
           (This      : in out World;
            Pair_Term : in     Term'Class) is
    begin
        This := Pair (This, Pair_Term);
    end Pair;


end Kompsos.Prelude;