equal
deleted
inserted
replaced
94 whole @{text SML} is read, the necessary code is generated transparently |
94 whole @{text SML} is read, the necessary code is generated transparently |
95 and the corresponding constant names are inserted. This technique also |
95 and the corresponding constant names are inserted. This technique also |
96 allows to use pattern matching on constructors stemming from compiled |
96 allows to use pattern matching on constructors stemming from compiled |
97 @{text "datatypes"}. |
97 @{text "datatypes"}. |
98 |
98 |
99 For a less simplistic example, theory @{theory Ferrack} is |
99 For a less simplistic example, theory @{text Ferrack} is |
100 a good reference. |
100 a good reference. |
101 *} |
101 *} |
102 |
102 |
103 |
103 |
104 end |
104 end |