lawspec 0.26.0 → 0.28.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +178 -1
- package/NORMALIZATION-LICENSES.txt +296 -0
- package/README.md +8 -0
- package/bin/lawspec.mjs +126 -33
- package/build.json +159 -131
- package/builtin-data-names.mjs +4 -4
- package/core.wasm +2 -2
- package/core_jsffi.js +5 -5
- package/doctor.mjs +14 -4
- package/examples/native-payments/elixir/lib/payments_domain.ex +1 -1
- package/examples/native-payments/erlang/src/payments_domain.erl +1 -1
- package/examples/native-payments/prolog/lawspec.json +20 -0
- package/examples/native-payments/prolog/src/domain/payments.pl +23 -0
- package/examples/native-payments/prolog/tests/domain/payment_generators.pl +17 -0
- package/examples/rc1/bit-codec.lawspec +6 -6
- package/examples/rc1/native-payments.lawspec +6 -6
- package/examples/rc1/nesting/rrr.lawspec +2 -2
- package/examples/rc1/nesting/rru.lawspec +4 -4
- package/examples/rc1/nesting/rur.lawspec +4 -4
- package/examples/rc1/nesting/ruu.lawspec +5 -5
- package/examples/rc1/nesting/urr.lawspec +4 -4
- package/examples/rc1/nesting/uru.lawspec +5 -5
- package/examples/rc1/nesting/uur.lawspec +5 -5
- package/examples/rc1/nesting/uuu.lawspec +6 -6
- package/examples/rc1/recursive-records.lawspec +5 -5
- package/examples/rc1/refund-policy.lawspec +4 -0
- package/examples/specs/approvals.lawspec +3 -3
- package/examples/specs/builtins.lawspec +2 -2
- package/examples/specs/collections.lawspec +8 -8
- package/examples/specs/composition.lawspec +10 -10
- package/examples/specs/contracts.lawspec +2 -2
- package/examples/specs/crypto.lawspec +2 -2
- package/examples/specs/domain_modeling.lawspec +20 -0
- package/examples/specs/flow_stack.lawspec +4 -4
- package/examples/specs/generation.lawspec +2 -2
- package/examples/specs/limits.lawspec +1 -1
- package/examples/specs/list_contracts.lawspec +3 -3
- package/examples/specs/lists.lawspec +6 -6
- package/examples/specs/matching.lawspec +8 -8
- package/examples/specs/payments.lawspec +5 -5
- package/examples/specs/records.lawspec +4 -4
- package/examples/specs/refinements.lawspec +4 -0
- package/examples/specs/resilience.lawspec +2 -2
- package/examples/specs/resources.lawspec +5 -5
- package/examples/specs/sequences.lawspec +1 -1
- package/examples/specs/sum_refinements.lawspec +11 -11
- package/examples-command.mjs +3 -1
- package/index.d.ts +160 -4
- package/native-evidence.mjs +25 -12
- package/native-examples.mjs +1 -1
- package/package.json +2 -1
- package/proof.d.ts +57 -12
- package/proof.mjs +277 -13
- package/templates.mjs +84 -3
- package/test-command.mjs +40 -4
package/CHANGELOG.md
CHANGED
|
@@ -6,6 +6,181 @@ to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
|
|
|
6
6
|
|
|
7
7
|
## [Unreleased]
|
|
8
8
|
|
|
9
|
+
## [0.28.0] - 2026-10-22
|
|
10
|
+
|
|
11
|
+
### Added
|
|
12
|
+
|
|
13
|
+
- Laws about observed histories: `law n in history h is definition: the
|
|
14
|
+
complete history holds P` (closed: proved or refuted) or `the history so far
|
|
15
|
+
holds P` (open: proved, refuted, or the new status `pending` while what
|
|
16
|
+
comes next decides). A deadline is refuted as soon as an entry is observed
|
|
17
|
+
past it.
|
|
18
|
+
- Model laws with deadlines (`whenever P, Q within 24h`) in whole
|
|
19
|
+
microsecond ticks, only through the model's `wait` command; a
|
|
20
|
+
missed deadline is refuted with the run and the time waited. For models
|
|
21
|
+
the explicit search cannot finish, `lawspec prove` proves an invariant by
|
|
22
|
+
induction, or by an invariant Z3's Spacer proposes and plain queries
|
|
23
|
+
re-check, and refutes one with a bounded run the evaluator replays.
|
|
24
|
+
- Laws about a model's runs: `property` declares a claim in plain words
|
|
25
|
+
(`always`, `eventually`, `whenever P, Q`, `never P before Q`, `until`),
|
|
26
|
+
and `law n in model m [assuming [strong] fairness for c] is definition:
|
|
27
|
+
every run holds P end definition end law` (or `some run holds P`) checks it
|
|
28
|
+
over the model's reference by an in-house explicit-state search, shared by
|
|
29
|
+
the native and WASM compilers. A law is proved with the number of states
|
|
30
|
+
explored, refuted with the run that breaks it, or incomplete past the
|
|
31
|
+
search's bound; native conformance keeps its own evidence.
|
|
32
|
+
- `lawspec prove` quantifies `Rational` inputs exactly (never an irrational
|
|
33
|
+
witness), handles `Decimal`, and reasons about `Float32` and `Float64` with
|
|
34
|
+
IEEE equality: NaN differs from itself and the zeros are equal. A law true
|
|
35
|
+
for reals but not floats is refuted with a float the evaluator confirms.
|
|
36
|
+
- `lawspec prove` reasons about `Text`: joining, length, slices, decimal
|
|
37
|
+
text, ordering, `starts with`, `ends with`, `contains` and
|
|
38
|
+
`matches regex`, using UTF-32BE to preserve the complete Unicode scalar
|
|
39
|
+
domain through U+10FFFF despite Z3's smaller alphabet. List length and joining are
|
|
40
|
+
supported too, and the codec portfolio and unbounded laws of the
|
|
41
|
+
Chapter 6 reference models are proved.
|
|
42
|
+
- `lawspec prove` proves laws by induction. A law's harness says
|
|
43
|
+
`prove by induction on xs`, citing other laws with `using "|a|`; with no
|
|
44
|
+
setting, a law with one list-like input gets one try. Each case is its own
|
|
45
|
+
task with its own receipt, a law rests on the laws it cites, and a case
|
|
46
|
+
whose model the law survives reports that the induction hypothesis is too
|
|
47
|
+
weak. The harness can also choose how recursion is unfolded:
|
|
48
|
+
`prove by unfolding step by step [up to n times]`,
|
|
49
|
+
`prove by solver recursion`, or both in turn (the default). Unproved laws
|
|
50
|
+
over recursive definitions get a counterexample search, so obviously false
|
|
51
|
+
ones are refuted.
|
|
52
|
+
- `lawspec prove` handles laws over recursive definitions. Each task gives Z3
|
|
53
|
+
the definitions unfolded step by step (guarded axioms with fuel, as Why3
|
|
54
|
+
and Dafny do) and by solver recursion (`define-fun-rec`); the host tries
|
|
55
|
+
them in turn, and the evidence records which one proved the law and every
|
|
56
|
+
attempt.
|
|
57
|
+
- The laws about a function are checked together: completeness, overlap,
|
|
58
|
+
conflict and vacuity, on by default. A `laws for f are ... end laws` block
|
|
59
|
+
states claims (`complete over`, `without overlap`, `without conflict`) and
|
|
60
|
+
excuses checks with a reason (`partial`, `overlap allowed`,
|
|
61
|
+
`conflict allowed until`, `vacuity allowed for`), until a project version
|
|
62
|
+
or a UTC date-time. An excused failure is `exempted`, a new status weaker
|
|
63
|
+
than `assumed`, and keeps its counterexample; an expired exemption is
|
|
64
|
+
`refuted` and fails the build. The `exhaustive` layer decides finite
|
|
65
|
+
domains; `lawspec prove` sends the rest to Z3, and the evaluator confirms
|
|
66
|
+
every input Z3 gives. `lawspec.json` gains `projectVersion`.
|
|
67
|
+
- A new evidence status, `refuted`: a law a confirmed counterexample shows
|
|
68
|
+
false (the compiler's exhaustive check, or a Z3 model the reference
|
|
69
|
+
evaluator confirms). The build still fails with a `refuted` diagnostic, and
|
|
70
|
+
`lawspec evidence` lists the law under `REFUTED` and exits with status 1.
|
|
71
|
+
- Z3 proof tasks cover data (`lawspec-smtlib-v2`): enums, records,
|
|
72
|
+
alternatives, structural records, `Maybe`, `List` and `Either` become SMT
|
|
73
|
+
datatypes whose field refinements are part of their well-formedness. The
|
|
74
|
+
refund policy and order lifecycle laws in `examples/rc1` are proved, and a
|
|
75
|
+
counterexample over data is read back and confirmed by the evaluator.
|
|
76
|
+
- `lawspec prove` validates counterexamples. When Z3 finds a law's negation
|
|
77
|
+
satisfiable, it gives values for the law's outer inputs, and the compiler
|
|
78
|
+
re-checks the law at them with its reference evaluator. A confirmed law is
|
|
79
|
+
`refuted` with its inputs, and `prove` exits with status 1. Unconfirmed
|
|
80
|
+
values are a `proof-translation` diagnostic, never a refutation.
|
|
81
|
+
- `lawspec-smtlib-v1` proof tasks are frozen byte for byte, checked against
|
|
82
|
+
a corpus of every current task. The compiler can name a later encoding,
|
|
83
|
+
`lawspec-smtlib-v2`, for tasks that need new features.
|
|
84
|
+
- A definition may rely on an ability operation's refined result. The
|
|
85
|
+
generated code checks each such result where the definition performs the
|
|
86
|
+
operation, and stops the definition if a handler broke the type.
|
|
87
|
+
`lawspec evidence` reports each check as `runtime-checked`.
|
|
88
|
+
### Changed
|
|
89
|
+
|
|
90
|
+
- **Breaking:** `Maybe`'s values are now `Present x` and `Absent`. They were
|
|
91
|
+
`Just x` and `Nothing`. The type is still `Maybe a`. The old names are not
|
|
92
|
+
aliases: a source that uses them is refused, and the error names the new
|
|
93
|
+
constructor. Generated code follows the new names wherever LawSpec's
|
|
94
|
+
constructors appear: data tags (`Maybe::Present`, `Maybe::Absent`), the
|
|
95
|
+
Python, JavaScript, TypeScript and JVM `Present` and `Absent` classes, the
|
|
96
|
+
Go `LawSpecPresent` and `LawSpecAbsent` helpers, the C# `Maybe.Absent`
|
|
97
|
+
helper, the typed Java `Maybe.present`, `absent` and `isPresent`, the
|
|
98
|
+
Erlang and Elixir `present` and `absent` atoms, rendered values, the
|
|
99
|
+
editor grammar and the npm names. Native mappings are unchanged: Rust,
|
|
100
|
+
Swift, Scala, F# and Gleam keep their options, and Haskell keeps `Maybe`.
|
|
101
|
+
|
|
102
|
+
### Fixed
|
|
103
|
+
|
|
104
|
+
- Proof execution discards imported settlement answers, checks the complete
|
|
105
|
+
solver protocol for law-set and model tasks, and records model solver
|
|
106
|
+
identities and raw output. An unavailable model solver stays explicit.
|
|
107
|
+
- Model induction keeps an unencodable command obligation incomplete rather
|
|
108
|
+
than proving only the remaining steps. Reachability counts obey the search
|
|
109
|
+
bound, and unfinished history searches cannot refute a law. Open history
|
|
110
|
+
deadlines stay pending, late responses fail, and backwards times are refused.
|
|
111
|
+
- Go harness statistics belong to each test run, so a law's boundary tests no
|
|
112
|
+
longer reset its property test's counts while they run in parallel. Python,
|
|
113
|
+
JavaScript, Rust, Haskell and Java (with Kotlin, Scala, Groovy and Clojure)
|
|
114
|
+
keep statistics per run too.
|
|
115
|
+
- The workflows example's `|an all group's checks run at the same time|` law
|
|
116
|
+
checks that the two slow checks overlapped in time, on every target,
|
|
117
|
+
instead of timing the call against 550 ms, which failed on a loaded machine.
|
|
118
|
+
|
|
119
|
+
## [0.27.0] - 2026-10-21
|
|
120
|
+
|
|
121
|
+
### Added
|
|
122
|
+
|
|
123
|
+
- The `prolog` program target uses SWI-Prolog and Janus with checked schemas,
|
|
124
|
+
native functions and handlers, Hypothesis generator factories, PLUnit
|
|
125
|
+
selection, replay and structured incomplete execution evidence. Its reference
|
|
126
|
+
page records supported interfaces and remaining acceptance work.
|
|
127
|
+
- Prolog native bindings support qualified record/variant/unit representations,
|
|
128
|
+
resolved nested field layouts, retained native handle tokens, constructors,
|
|
129
|
+
methods and typed native exception mappings, including message products.
|
|
130
|
+
- The `hcl`, `yaml`, `antlr4` and `make` artifact targets emit checked
|
|
131
|
+
configuration, schemas, syntax grammars and ordered CLI pipelines. Missing
|
|
132
|
+
inputs and unsupported constraints remain explicit; artifact generation
|
|
133
|
+
does not claim application law execution.
|
|
134
|
+
- Generated Rust handlers expose supported construction and state
|
|
135
|
+
snapshot/restoration methods for embedding checked reference models.
|
|
136
|
+
- `lawspec evidence --attestation` links each law `lawspec test` recorded
|
|
137
|
+
under the attestation's run id to that run as completed, with its outcome
|
|
138
|
+
and the run's exit code. An attestation whose `execution.status` is
|
|
139
|
+
`wired` or `running` stays planned and says why.
|
|
140
|
+
- Evidence reports a completed run's architecture, topology and application
|
|
141
|
+
identities and, per dependency, its node, edge, contract, implementation
|
|
142
|
+
and whether the real provider or a fixture implemented it, with the
|
|
143
|
+
history it ran against (the completed history digest, else the
|
|
144
|
+
stand-in's). Each law lists its providers.
|
|
145
|
+
|
|
146
|
+
### Fixed
|
|
147
|
+
|
|
148
|
+
- BEAM workflow acceptance checks observe overlapping checks within their own
|
|
149
|
+
runtime instead of a host-speed deadline. Sequential and unrelated-runtime
|
|
150
|
+
mutants must fail the concurrency law. Erlang's hedge check observes the
|
|
151
|
+
winning attempt and cancellation of its stalled predecessor, with an explicit
|
|
152
|
+
missing-hedge control.
|
|
153
|
+
- Cached `lawspec evidence` keeps explicit running or wired environment
|
|
154
|
+
attestations planned. Passing native tests no longer relabel an unfinished
|
|
155
|
+
environment as executed wiring. Completed documents retain their outcomes;
|
|
156
|
+
older receipts without execution states keep their existing meaning.
|
|
157
|
+
|
|
158
|
+
- ANTLR includes concrete declaration inputs and exports typed EOF parser
|
|
159
|
+
entries with exact schema references. Overlapping generic representations
|
|
160
|
+
retain their expected type; closed indexed inputs remain explicitly unsupported.
|
|
161
|
+
- Prolog application and generator modules retain qualified predicate names
|
|
162
|
+
without conflicting imports into the global `user` module.
|
|
163
|
+
- Prolog retains the host harness's seeded ordering, parallel execution and
|
|
164
|
+
shared-resource scopes in one selected test session. Per-slot reports keep
|
|
165
|
+
incomplete worker results distinct from failures and successful cases.
|
|
166
|
+
- Cancelling an async Prolog waiter releases timeouts and losing hedges
|
|
167
|
+
without joining still-running native work at event-loop shutdown. Worker
|
|
168
|
+
contexts and structured incomplete results remain attached to their calls.
|
|
169
|
+
- Cached network replies tolerate a caller that already closed, as original
|
|
170
|
+
replies do. Duplicate requests still reuse their recorded result.
|
|
171
|
+
- Prolog uses plain assertions and standard Python tracebacks for large
|
|
172
|
+
generated suites. Optimized Python is rejected before native execution or
|
|
173
|
+
cache reuse, so removed assertions cannot produce successful law evidence.
|
|
174
|
+
- A complete empty input domain retains its Core evidence without planning a
|
|
175
|
+
nonexistent native test. Unexpected empty native discovery still fails.
|
|
176
|
+
- A stand-in's history digest, and other observations of a run, no longer
|
|
177
|
+
make attested results stale; results are keyed by wiring only.
|
|
178
|
+
- An environment attestation stored inside the project is no longer a
|
|
179
|
+
project input, so rewriting it as the run completes leaves results fresh.
|
|
180
|
+
- A refinement alias in an ability operation's signature elaborates, and its
|
|
181
|
+
implied result law is generated; a type that cannot reach Core is reported
|
|
182
|
+
at the declaration that uses it.
|
|
183
|
+
|
|
9
184
|
## [0.26.0] - 2026-10-19
|
|
10
185
|
|
|
11
186
|
### Added
|
|
@@ -1740,7 +1915,9 @@ A maintenance release. The language, generated code and API are unchanged from
|
|
|
1740
1915
|
machine-sized bindings reject an architecture mismatch. Rust adapters take
|
|
1741
1916
|
owned values.
|
|
1742
1917
|
|
|
1743
|
-
[Unreleased]: https://github.com/brain-fuel/lawspec/compare/v0.
|
|
1918
|
+
[Unreleased]: https://github.com/brain-fuel/lawspec/compare/v0.28.0...HEAD
|
|
1919
|
+
[0.28.0]: https://github.com/brain-fuel/lawspec/compare/v0.27.0...v0.28.0
|
|
1920
|
+
[0.27.0]: https://github.com/brain-fuel/lawspec/compare/v0.26.0...v0.27.0
|
|
1744
1921
|
[0.26.0]: https://github.com/brain-fuel/lawspec/compare/v0.25.0...v0.26.0
|
|
1745
1922
|
[0.25.0]: https://github.com/brain-fuel/lawspec/compare/v0.24.0...v0.25.0
|
|
1746
1923
|
[0.24.0]: https://github.com/brain-fuel/lawspec/compare/v0.23.0...v0.24.0
|
|
@@ -0,0 +1,296 @@
|
|
|
1
|
+
Normalization dependencies used by the HCL artifact emitter.
|
|
2
|
+
Source packages: https://hackage.haskell.org/package/unicode-data-0.6.0 and https://hackage.haskell.org/package/unicode-transforms-0.4.0.1
|
|
3
|
+
|
|
4
|
+
|
|
5
|
+
unicode-data-0.6.0 / LICENSE
|
|
6
|
+
|
|
7
|
+
Apache License
|
|
8
|
+
Version 2.0, January 2004
|
|
9
|
+
http://www.apache.org/licenses/
|
|
10
|
+
|
|
11
|
+
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
|
12
|
+
|
|
13
|
+
1. Definitions.
|
|
14
|
+
|
|
15
|
+
"License" shall mean the terms and conditions for use, reproduction,
|
|
16
|
+
and distribution as defined by Sections 1 through 9 of this document.
|
|
17
|
+
|
|
18
|
+
"Licensor" shall mean the copyright owner or entity authorized by
|
|
19
|
+
the copyright owner that is granting the License.
|
|
20
|
+
|
|
21
|
+
"Legal Entity" shall mean the union of the acting entity and all
|
|
22
|
+
other entities that control, are controlled by, or are under common
|
|
23
|
+
control with that entity. For the purposes of this definition,
|
|
24
|
+
"control" means (i) the power, direct or indirect, to cause the
|
|
25
|
+
direction or management of such entity, whether by contract or
|
|
26
|
+
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
|
27
|
+
outstanding shares, or (iii) beneficial ownership of such entity.
|
|
28
|
+
|
|
29
|
+
"You" (or "Your") shall mean an individual or Legal Entity
|
|
30
|
+
exercising permissions granted by this License.
|
|
31
|
+
|
|
32
|
+
"Source" form shall mean the preferred form for making modifications,
|
|
33
|
+
including but not limited to software source code, documentation
|
|
34
|
+
source, and configuration files.
|
|
35
|
+
|
|
36
|
+
"Object" form shall mean any form resulting from mechanical
|
|
37
|
+
transformation or translation of a Source form, including but
|
|
38
|
+
not limited to compiled object code, generated documentation,
|
|
39
|
+
and conversions to other media types.
|
|
40
|
+
|
|
41
|
+
"Work" shall mean the work of authorship, whether in Source or
|
|
42
|
+
Object form, made available under the License, as indicated by a
|
|
43
|
+
copyright notice that is included in or attached to the work.
|
|
44
|
+
|
|
45
|
+
"Derivative Works" shall mean any work, whether in Source or Object
|
|
46
|
+
form, that is based on (or derived from) the Work and for which the
|
|
47
|
+
editorial revisions, annotations, elaborations, or other modifications
|
|
48
|
+
represent, as a whole, an original work of authorship. For the purposes
|
|
49
|
+
of this License, Derivative Works shall not include works that remain
|
|
50
|
+
separable from, or merely link (or bind by name) to the interfaces of,
|
|
51
|
+
the Work and Derivative Works thereof.
|
|
52
|
+
|
|
53
|
+
"Contribution" shall mean any work of authorship, including
|
|
54
|
+
the original version of the Work and any modifications or additions
|
|
55
|
+
to that Work or Derivative Works thereof, that is intentionally
|
|
56
|
+
submitted to Licensor for inclusion in the Work by the copyright owner
|
|
57
|
+
or by an individual or Legal Entity authorized to submit on behalf of
|
|
58
|
+
the copyright owner. For the purposes of this definition, "submitted"
|
|
59
|
+
means any form of electronic, verbal, or written communication sent
|
|
60
|
+
to the Licensor or its representatives, including but not limited to
|
|
61
|
+
communication on electronic mailing lists, source code control systems,
|
|
62
|
+
and issue tracking systems that are managed by, or on behalf of, the
|
|
63
|
+
Licensor for the purpose of discussing and improving the Work, but
|
|
64
|
+
excluding communication that is conspicuously marked or otherwise
|
|
65
|
+
designated in writing by the copyright owner as "Not a Contribution."
|
|
66
|
+
|
|
67
|
+
"Contributor" shall mean Licensor and any individual or Legal Entity
|
|
68
|
+
on behalf of whom a Contribution has been received by Licensor and
|
|
69
|
+
subsequently incorporated within the Work.
|
|
70
|
+
|
|
71
|
+
2. Grant of Copyright License. Subject to the terms and conditions of
|
|
72
|
+
this License, each Contributor hereby grants to You a perpetual,
|
|
73
|
+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
|
74
|
+
copyright license to reproduce, prepare Derivative Works of,
|
|
75
|
+
publicly display, publicly perform, sublicense, and distribute the
|
|
76
|
+
Work and such Derivative Works in Source or Object form.
|
|
77
|
+
|
|
78
|
+
3. Grant of Patent License. Subject to the terms and conditions of
|
|
79
|
+
this License, each Contributor hereby grants to You a perpetual,
|
|
80
|
+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
|
81
|
+
(except as stated in this section) patent license to make, have made,
|
|
82
|
+
use, offer to sell, sell, import, and otherwise transfer the Work,
|
|
83
|
+
where such license applies only to those patent claims licensable
|
|
84
|
+
by such Contributor that are necessarily infringed by their
|
|
85
|
+
Contribution(s) alone or by combination of their Contribution(s)
|
|
86
|
+
with the Work to which such Contribution(s) was submitted. If You
|
|
87
|
+
institute patent litigation against any entity (including a
|
|
88
|
+
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
|
89
|
+
or a Contribution incorporated within the Work constitutes direct
|
|
90
|
+
or contributory patent infringement, then any patent licenses
|
|
91
|
+
granted to You under this License for that Work shall terminate
|
|
92
|
+
as of the date such litigation is filed.
|
|
93
|
+
|
|
94
|
+
4. Redistribution. You may reproduce and distribute copies of the
|
|
95
|
+
Work or Derivative Works thereof in any medium, with or without
|
|
96
|
+
modifications, and in Source or Object form, provided that You
|
|
97
|
+
meet the following conditions:
|
|
98
|
+
|
|
99
|
+
(a) You must give any other recipients of the Work or
|
|
100
|
+
Derivative Works a copy of this License; and
|
|
101
|
+
|
|
102
|
+
(b) You must cause any modified files to carry prominent notices
|
|
103
|
+
stating that You changed the files; and
|
|
104
|
+
|
|
105
|
+
(c) You must retain, in the Source form of any Derivative Works
|
|
106
|
+
that You distribute, all copyright, patent, trademark, and
|
|
107
|
+
attribution notices from the Source form of the Work,
|
|
108
|
+
excluding those notices that do not pertain to any part of
|
|
109
|
+
the Derivative Works; and
|
|
110
|
+
|
|
111
|
+
(d) If the Work includes a "NOTICE" text file as part of its
|
|
112
|
+
distribution, then any Derivative Works that You distribute must
|
|
113
|
+
include a readable copy of the attribution notices contained
|
|
114
|
+
within such NOTICE file, excluding those notices that do not
|
|
115
|
+
pertain to any part of the Derivative Works, in at least one
|
|
116
|
+
of the following places: within a NOTICE text file distributed
|
|
117
|
+
as part of the Derivative Works; within the Source form or
|
|
118
|
+
documentation, if provided along with the Derivative Works; or,
|
|
119
|
+
within a display generated by the Derivative Works, if and
|
|
120
|
+
wherever such third-party notices normally appear. The contents
|
|
121
|
+
of the NOTICE file are for informational purposes only and
|
|
122
|
+
do not modify the License. You may add Your own attribution
|
|
123
|
+
notices within Derivative Works that You distribute, alongside
|
|
124
|
+
or as an addendum to the NOTICE text from the Work, provided
|
|
125
|
+
that such additional attribution notices cannot be construed
|
|
126
|
+
as modifying the License.
|
|
127
|
+
|
|
128
|
+
You may add Your own copyright statement to Your modifications and
|
|
129
|
+
may provide additional or different license terms and conditions
|
|
130
|
+
for use, reproduction, or distribution of Your modifications, or
|
|
131
|
+
for any such Derivative Works as a whole, provided Your use,
|
|
132
|
+
reproduction, and distribution of the Work otherwise complies with
|
|
133
|
+
the conditions stated in this License.
|
|
134
|
+
|
|
135
|
+
5. Submission of Contributions. Unless You explicitly state otherwise,
|
|
136
|
+
any Contribution intentionally submitted for inclusion in the Work
|
|
137
|
+
by You to the Licensor shall be under the terms and conditions of
|
|
138
|
+
this License, without any additional terms or conditions.
|
|
139
|
+
Notwithstanding the above, nothing herein shall supersede or modify
|
|
140
|
+
the terms of any separate license agreement you may have executed
|
|
141
|
+
with Licensor regarding such Contributions.
|
|
142
|
+
|
|
143
|
+
6. Trademarks. This License does not grant permission to use the trade
|
|
144
|
+
names, trademarks, service marks, or product names of the Licensor,
|
|
145
|
+
except as required for reasonable and customary use in describing the
|
|
146
|
+
origin of the Work and reproducing the content of the NOTICE file.
|
|
147
|
+
|
|
148
|
+
7. Disclaimer of Warranty. Unless required by applicable law or
|
|
149
|
+
agreed to in writing, Licensor provides the Work (and each
|
|
150
|
+
Contributor provides its Contributions) on an "AS IS" BASIS,
|
|
151
|
+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
|
152
|
+
implied, including, without limitation, any warranties or conditions
|
|
153
|
+
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
|
154
|
+
PARTICULAR PURPOSE. You are solely responsible for determining the
|
|
155
|
+
appropriateness of using or redistributing the Work and assume any
|
|
156
|
+
risks associated with Your exercise of permissions under this License.
|
|
157
|
+
|
|
158
|
+
8. Limitation of Liability. In no event and under no legal theory,
|
|
159
|
+
whether in tort (including negligence), contract, or otherwise,
|
|
160
|
+
unless required by applicable law (such as deliberate and grossly
|
|
161
|
+
negligent acts) or agreed to in writing, shall any Contributor be
|
|
162
|
+
liable to You for damages, including any direct, indirect, special,
|
|
163
|
+
incidental, or consequential damages of any character arising as a
|
|
164
|
+
result of this License or out of the use or inability to use the
|
|
165
|
+
Work (including but not limited to damages for loss of goodwill,
|
|
166
|
+
work stoppage, computer failure or malfunction, or any and all
|
|
167
|
+
other commercial damages or losses), even if such Contributor
|
|
168
|
+
has been advised of the possibility of such damages.
|
|
169
|
+
|
|
170
|
+
9. Accepting Warranty or Additional Liability. While redistributing
|
|
171
|
+
the Work or Derivative Works thereof, You may choose to offer,
|
|
172
|
+
and charge a fee for, acceptance of support, warranty, indemnity,
|
|
173
|
+
or other liability obligations and/or rights consistent with this
|
|
174
|
+
License. However, in accepting such obligations, You may act only
|
|
175
|
+
on Your own behalf and on Your sole responsibility, not on behalf
|
|
176
|
+
of any other Contributor, and only if You agree to indemnify,
|
|
177
|
+
defend, and hold each Contributor harmless for any liability
|
|
178
|
+
incurred by, or claims asserted against, such Contributor by reason
|
|
179
|
+
of your accepting any such warranty or additional liability.
|
|
180
|
+
|
|
181
|
+
END OF TERMS AND CONDITIONS
|
|
182
|
+
|
|
183
|
+
-------------------------------------------------------------------------------
|
|
184
|
+
This distribution includes portions of code from the "unicode-transforms"
|
|
185
|
+
package (https://github.com/composewell/unicode-transforms/) which is
|
|
186
|
+
available under BSD-3-Clause license as described below.
|
|
187
|
+
-------------------------------------------------------------------------------
|
|
188
|
+
|
|
189
|
+
Copyright (c) 2016, Harendra Kumar
|
|
190
|
+
All rights reserved.
|
|
191
|
+
|
|
192
|
+
Redistribution and use in source and binary forms, with or without
|
|
193
|
+
modification, are permitted provided that the following conditions are met:
|
|
194
|
+
|
|
195
|
+
1. Redistributions of source code must retain the above copyright notice, this
|
|
196
|
+
list of conditions and the following disclaimer.
|
|
197
|
+
|
|
198
|
+
2. Redistributions in binary form must reproduce the above copyright notice,
|
|
199
|
+
this list of conditions and the following disclaimer in the documentation
|
|
200
|
+
and/or other materials provided with the distribution.
|
|
201
|
+
|
|
202
|
+
3. Neither the name of the copyright holder nor the names of its contributors
|
|
203
|
+
may be used to endorse or promote products derived from this software without
|
|
204
|
+
specific prior written permission.
|
|
205
|
+
|
|
206
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
207
|
+
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
208
|
+
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
209
|
+
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
210
|
+
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
211
|
+
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
212
|
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
213
|
+
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
214
|
+
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
215
|
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
216
|
+
|
|
217
|
+
-------------------------------------------------------------------------------
|
|
218
|
+
This distribution includes portions of code from the "unicode-transforms"
|
|
219
|
+
package (https://github.com/composewell/unicode-transforms/)
|
|
220
|
+
which included portions of code from the "prose"
|
|
221
|
+
(https://github.com/llelf/prose) package available under BSD-3-Clause
|
|
222
|
+
license as described below.
|
|
223
|
+
-------------------------------------------------------------------------------
|
|
224
|
+
|
|
225
|
+
Copyright (c) 2014–2015, Antonio Nikishaev
|
|
226
|
+
|
|
227
|
+
All rights reserved.
|
|
228
|
+
|
|
229
|
+
Redistribution and use in source and binary forms, with or without
|
|
230
|
+
modification, are permitted provided that the following conditions are met:
|
|
231
|
+
|
|
232
|
+
* Redistributions of source code must retain the above copyright
|
|
233
|
+
notice, this list of conditions and the following disclaimer.
|
|
234
|
+
|
|
235
|
+
* Redistributions in binary form must reproduce the above
|
|
236
|
+
copyright notice, this list of conditions and the following
|
|
237
|
+
disclaimer in the documentation and/or other materials provided
|
|
238
|
+
with the distribution.
|
|
239
|
+
|
|
240
|
+
* Neither the name of Antonio Nikishaev nor the names of other
|
|
241
|
+
contributors may be used to endorse or promote products derived
|
|
242
|
+
from this software without specific prior written permission.
|
|
243
|
+
|
|
244
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
245
|
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
246
|
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
247
|
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
248
|
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
249
|
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
250
|
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
251
|
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
252
|
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
253
|
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
254
|
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
255
|
+
|
|
256
|
+
|
|
257
|
+
unicode-data-0.6.0 / NOTICE
|
|
258
|
+
unicode-data
|
|
259
|
+
Copyright 2020 Composewell Technologies and Contributors
|
|
260
|
+
|
|
261
|
+
This product includes software developed at
|
|
262
|
+
Composewell Technologies (http://www.composewell.com).
|
|
263
|
+
|
|
264
|
+
The Initial Developer of some parts of the code, which are copied from
|
|
265
|
+
https://github.com/composewell/unicode-transforms/, is Andrew Lelechenko
|
|
266
|
+
(https://github.com/Bodigrim).
|
|
267
|
+
|
|
268
|
+
|
|
269
|
+
unicode-transforms-0.4.0.1 / LICENSE
|
|
270
|
+
Copyright (c) 2016, Harendra Kumar
|
|
271
|
+
All rights reserved.
|
|
272
|
+
|
|
273
|
+
Redistribution and use in source and binary forms, with or without
|
|
274
|
+
modification, are permitted provided that the following conditions are met:
|
|
275
|
+
|
|
276
|
+
1. Redistributions of source code must retain the above copyright notice, this
|
|
277
|
+
list of conditions and the following disclaimer.
|
|
278
|
+
|
|
279
|
+
2. Redistributions in binary form must reproduce the above copyright notice,
|
|
280
|
+
this list of conditions and the following disclaimer in the documentation
|
|
281
|
+
and/or other materials provided with the distribution.
|
|
282
|
+
|
|
283
|
+
3. Neither the name of the copyright holder nor the names of its contributors
|
|
284
|
+
may be used to endorse or promote products derived from this software without
|
|
285
|
+
specific prior written permission.
|
|
286
|
+
|
|
287
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
288
|
+
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
289
|
+
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
290
|
+
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
291
|
+
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
292
|
+
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
293
|
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
294
|
+
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
295
|
+
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
296
|
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
package/README.md
CHANGED
|
@@ -116,6 +116,14 @@ configure.
|
|
|
116
116
|
|
|
117
117
|
See the [target guides](docs/how-to/targets/index.md).
|
|
118
118
|
|
|
119
|
+
The [Prolog target](docs/reference/prolog.md) uses SWI-Prolog 10+, Janus and
|
|
120
|
+
Python 3.13+, with PLUnit slots over pytest and Hypothesis. Its public interfaces
|
|
121
|
+
are implemented; the full shared native acceptance matrix remains open.
|
|
122
|
+
|
|
123
|
+
The [artifact targets](docs/reference/artifact-targets.md) generate HCL
|
|
124
|
+
variables and values, YAML configuration and schemas, ANTLR data grammars,
|
|
125
|
+
and Make pipelines. These targets emit no application law tests.
|
|
126
|
+
|
|
119
127
|
## Documentation
|
|
120
128
|
|
|
121
129
|
The [documentation](docs/index.md) has tutorials, how-to guides, a reference
|