slightly less abusive proof pattern

note on signed division on words

tuned definition

spelling

tuned proof

slightly less abusive proof pattern

syntactic type classes for signed division operators

tuned proofs

reduce prominence of facts

adjusted to distribution

moved relevant theorems from theory Divides to theory Euclidean_Division

streamlined division on polynomials

streamlined division on polynomials

adjusted to distribution

streamlined division on polynomials

streamlined division on polynomials

More on division concerning gauss numbers.

more concise instance-specific rules on euclidean relation

putting together related theorems

dropped auxiliary lemma

streamlined

less specialized euclidean relation on int

clarified generic euclidean relation

avoid duplicate fact error on global_interpretation of residues

avoid fact name clash

avoid looping simplification for z2

adjusted to distribution

repaired proof

Gauss numbers

streamlined

simplified computation algorithm construction

streamlined

tuned type signature

tuned type signature

streamlined theorems

more thorough split rules for div and mod on numerals, tuned split rules setup

consolidated attribute name

streamlined simpset building, avoiding duplicated rewrite rules

streamlined theorems

streamlined theorems and sections

tuned proofs

streamlined primitive definitions for integer division

streamlined primitive definitions for integer division

Further streamlining of quick-and-dirty evaluation.

Further streamlining of quick-and-dirty evaluation.

An attempt for an integrated solution for quick-and-dirty evaluation.

More lemmas.

Some more proofs.

Avoid shadowing original List._ namespace.

refined code equations for characters

refined code equations for characters

tuned

removed more material now residing in distribution

separated non-computable instance of bit comprehension from computable one

sketch for word-specific lsb and msb

Move code lemmas for symbolic computation of bit operations on int to…

Move code lemmas for symbolic computation of bit operations on int to…

corrections and adjustions for Scala 3

more complete set of code equations

officical abstract characters for code generation

More lemmas.

Centralized some char-related lemmas in distribution.

Avoid calculations where not necessary.

Avoid calculations where not necessary.

Prefer existing horner sum combinator.

Less warnings.

Executable lexords.

Avoid explicit operation when not necessary.

Trimmed down dependencies.

»nil« seems to be a reserved constructor word in PolyML

documentation on diagnostic devices for code generation

more correct language

moved from AFP to distribution

tuned syntax

moved from AFP to distribution

adjusted printing of type annotations to accomodate Scala 3

pass constructor arity as part of case certficiate

tuned whitespace in generated code

avoid side effects on working copy while runnign sessions (generated code is…

tuned, centralizing case distinction at one place at the cost of modest…

tuned

tuned

NEWS and CONTRIBUTORS

regenerated

tighter check to ensure that patterns remain left-linear, previous…

tuned

tuned

separated treatment of undefined bodys

modernized handling of variables

tuned arguments

structurally tuned

tuned names

prefer build combinator

tuned whitespace

tuned

separated case reduction

separated selector function entirely

self-contained extraction auf clauses

streamlined

extracted selector function, restoring code generation for let expressions