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
|
// Copyright (c) 2023, Marvin Borner <dev@marvinborner.de>
// SPDX-License-Identifier: MIT
#include <stdio.h>
#include <term.h>
#include <map.h>
#include <reduce.h>
#include <log.h>
#include <assert.h>
// parent rehashing done by caller
static struct term *shift(struct term *term, size_t level, size_t amount)
{
debug("shifting %lx\n", term->hash & HASH_MASK);
if (term->type == VAR) {
if (level > term->u.var.index)
return term;
term->refs += 1; // TODO: Kinda hacky
return term_rehash_var(term, term->u.var.index + amount, 0);
} else if (term->type == ABS) {
struct term *previous = term->u.abs.term;
struct term *new = shift(term->u.abs.term, level + 1, amount);
if (previous->hash == new->hash)
return term; // nothing changed
term->refs += 1;
return term_rehash_abs(term, new, 0);
} else if (term->type == APP) {
hash_t previous_lhs = term->u.app.lhs->hash;
hash_t previous_rhs = term->u.app.rhs->hash;
struct term *lhs = shift(term->u.app.lhs, level, amount);
struct term *rhs = shift(term->u.app.rhs, level, amount);
if (previous_lhs == lhs->hash && previous_rhs == rhs->hash)
return term; // nothing changed
term->refs += 1;
return term_rehash_app(term, lhs, rhs, 0);
}
fatal("invalid type %d\n", term->type);
}
// only substitutes (and therefore increments indices and rehashes)
static struct term *substitute(struct term *term, struct term *substitution,
size_t level)
{
debug("substituting %lx with %lx\n", term->hash & HASH_MASK,
substitution->hash & HASH_MASK);
if (term->type == VAR) {
if (level == term->u.var.index) { // replace by shifted term
struct term *shifted = shift(substitution, 0, level);
return shifted;
} else if (level > term->u.var.index) { // crush unbound
return term;
} else { // shift idx by -1
struct term *shifted = shift(term, 0, -1);
return shifted;
}
} else if (term->type == ABS) {
struct term *previous = term->u.abs.term;
hash_t previous_hash = term->u.abs.term->hash;
/* term->refs += 1; */
/* previous->refs += 1; */
struct term *new =
substitute(term->u.abs.term, substitution, level + 1);
if (previous_hash == new->hash)
return new; // nothing changed
struct term *rehashed = term_rehash_abs(term, new, 1);
term_rehash_parents(rehashed);
return rehashed;
} else if (term->type == APP) { // no beta reduction; just substitution
hash_t previous_lhs = term->u.app.lhs->hash;
hash_t previous_rhs = term->u.app.rhs->hash;
struct term *lhs =
substitute(term->u.app.lhs, substitution, level);
struct term *rhs =
substitute(term->u.app.rhs, substitution, level);
if (previous_lhs == lhs->hash && previous_rhs == rhs->hash)
return term; // nothing changed
struct term *rehashed = term_rehash_app(term, lhs, rhs, 1);
term_rehash_parents(rehashed);
return rehashed;
}
fatal("invalid type %d\n", term->type);
}
// reduction of application
// ([X] Y) -> X/Y
struct term *reduce(struct term *term)
{
if (!term_is_beta_redex(term))
fatal("can't reduce non-beta-redex %d\n", term->type);
debug("reducing %lx\n", term->hash & HASH_MASK);
return substitute(term->u.app.lhs, term->u.app.rhs, -1);
}
|
