&
Łukasiewicz
1
1
2
2
3
3
A
accumulator alias arrays artificial axiomatic
B
bidirectional-transformation binarysearch binarytree, bst bytelandian
C
call-by-value-pattern chess chess, coffee, coins comprehension computation concurrent_distinct_choices constrained_constructor constraints contract cubic curry curry,
D
data default default_rules delete design_pattern difference-lists differnce_list duplicate-elimination
E
euclic ex4 example exercise
F
fermat find finite_domain fix fo for function functional functional-pattern functional-patterns functionalpatterns functional_logic_design_pattern functional_logic_patterns functional_pattern function_inversion
G
generate-and-test geomapping gold graph,
H
haskell haskell, heavyass high-order higher-order hw
I
idsardi implementation implicational_logic in, incremental_solution infinitelists interpreter inverse
J
jan
K
knight knigts
L
list logic logic_programming loop
M
many-to-many_relation mapping map_coloring me mini_sudoku models month
N
n-queens_puzzle narrowing non-determinism non-termination nondeterminism non_determinism no_builtin nqueens nqueens, nub
P
path patternmatching perm, permutation permute pollard polynomial prime programming program_transformation prolog proof propositional_logic punto_di_domanda puzzle puzzles
Q
quicksort
R
recursion reverse
S
search set_functions shapes sort sorting stability string sumlist system
T
test tour tour, tree trying type type_induction type_inference
U
u2 unification utility
V
variables verification
W
wang_tiles