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
|
#include "concept.hpp"
#include "helpers.hpp"
#include "meaning.hpp"
#include <iostream>
void dumpconcept(ref r)
{
decllnks(dumped, name);
for (auto & l : r->links) {
if (ref(l.first) == name) {
continue;
}
std::cout << r << " " << ref(l.first) << " " << ref(l.second) << std::endl;
}
if (!r->linked(dumped)) {
r[dumped = true];
}
for (auto & l : r->links) {
if (!l.second->linked(dumped)) {
dumpconcept(l.second);
}
}
}
int main()
{
declrefs(make, linked, habit);
declrefs(structure, function, argument, position, provide);
decllnks(needs, assumes, makes);
decllnks(A, B, C);
decllnks(is);
lnks(argument-position);
// add a new unique link to a concept
// given A, B, C
// and assuming A is not linked by B to C,
// makes A be linked by B to C.
// NEXT? make code for make-linked that takes a ref
// change the needs structure to use a model for the ref,
// with needed values specified as 'provided'
make-linked = a(habit)[
needs = a(structure)[
is = function-argument,
argument-position = vref<int>(1),
avariable(A) = provide,
avariable(B) = provide,
avariable(C) = provide
],
assumes = not(A-B-C-linked = link(A, B, C)),
makes = A-B-C-linked
];
dumpconcept(make-linked);
}
|
