@tuprolog/2p-full 2.0.9 → 3.0.1

package/2p-oop-lib.js

@@ -1,18 +1,18 @@
 (function (factory) {
   if (typeof define === 'function' && define.amd)
-    define(['exports', './kotlin-kotlin-stdlib.js', './2p-solve.js', './kt-math.js', './2p-core.js', './2p-utils.js', './2p-unify.js'], factory);
+    define(['exports', './kotlin-kotlin-stdlib.js', './kt-math.js', './2p-solve.js', './2p-core.js', './2p-utils.js', './2p-unify.js'], factory);
   else if (typeof exports === 'object')
-    factory(module.exports, require('./kotlin-kotlin-stdlib.js'), require('./2p-solve.js'), require('./kt-math.js'), require('./2p-core.js'), require('./2p-utils.js'), require('./2p-unify.js'));
+    factory(module.exports, require('./kotlin-kotlin-stdlib.js'), require('./kt-math.js'), require('./2p-solve.js'), require('./2p-core.js'), require('./2p-utils.js'), require('./2p-unify.js'));
   else {
     if (typeof globalThis['kotlin-kotlin-stdlib'] === 'undefined') {
       throw new Error("Error loading module '2p-oop-lib'. Its dependency 'kotlin-kotlin-stdlib' was not found. Please, check whether 'kotlin-kotlin-stdlib' is loaded prior to '2p-oop-lib'.");
     }
-    if (typeof globalThis['2p-solve'] === 'undefined') {
-      throw new Error("Error loading module '2p-oop-lib'. Its dependency '2p-solve' was not found. Please, check whether '2p-solve' is loaded prior to '2p-oop-lib'.");
-    }
     if (typeof globalThis['kt-math'] === 'undefined') {
       throw new Error("Error loading module '2p-oop-lib'. Its dependency 'kt-math' was not found. Please, check whether 'kt-math' is loaded prior to '2p-oop-lib'.");
     }
+    if (typeof globalThis['2p-solve'] === 'undefined') {
+      throw new Error("Error loading module '2p-oop-lib'. Its dependency '2p-solve' was not found. Please, check whether '2p-solve' is loaded prior to '2p-oop-lib'.");
+    }
     if (typeof globalThis['2p-core'] === 'undefined') {
       throw new Error("Error loading module '2p-oop-lib'. Its dependency '2p-core' was not found. Please, check whether '2p-core' is loaded prior to '2p-oop-lib'.");
     }
@@ -22,141 +22,146 @@
     if (typeof globalThis['2p-unify'] === 'undefined') {
       throw new Error("Error loading module '2p-oop-lib'. Its dependency '2p-unify' was not found. Please, check whether '2p-unify' is loaded prior to '2p-oop-lib'.");
     }
-    globalThis['2p-oop-lib'] = factory(typeof globalThis['2p-oop-lib'] === 'undefined' ? {} : globalThis['2p-oop-lib'], globalThis['kotlin-kotlin-stdlib'], globalThis['2p-solve'], globalThis['kt-math'], globalThis['2p-core'], globalThis['2p-utils'], globalThis['2p-unify']);
+    globalThis['2p-oop-lib'] = factory(typeof globalThis['2p-oop-lib'] === 'undefined' ? {} : globalThis['2p-oop-lib'], globalThis['kotlin-kotlin-stdlib'], globalThis['kt-math'], globalThis['2p-solve'], globalThis['2p-core'], globalThis['2p-utils'], globalThis['2p-unify']);
   }
-}(function (_, kotlin_kotlin, kotlin_it_unibo_tuprolog_solve, kotlin_io_github_gciatto_kt_math, kotlin_it_unibo_tuprolog_core, kotlin_it_unibo_tuprolog_utils, kotlin_it_unibo_tuprolog_unify) {
+}(function (_, kotlin_kotlin, kotlin_io_github_gciatto_kt_math, kotlin_it_unibo_tuprolog_solve, kotlin_it_unibo_tuprolog_core, kotlin_it_unibo_tuprolog_utils, kotlin_it_unibo_tuprolog_unify) {
   'use strict';
   //region block: imports
   var NullPointerException_init_$Create$ = kotlin_kotlin.$_$.t1;
-  var protoOf = kotlin_kotlin.$_$.r8;
-  var initMetadataForInterface = kotlin_kotlin.$_$.d8;
+  var protoOf = kotlin_kotlin.$_$.s8;
+  var initMetadataForInterface = kotlin_kotlin.$_$.e8;
   var VOID = kotlin_kotlin.$_$.b;
-  var AbstractLibrary = kotlin_it_unibo_tuprolog_solve.$_$.v2;
-  var listOf = kotlin_kotlin.$_$.g4;
-  var collectionSizeOrDefault = kotlin_kotlin.$_$.w2;
-  var ArrayList_init_$Create$ = kotlin_kotlin.$_$.t;
-  var to = kotlin_kotlin.$_$.we;
-  var Unit_instance = kotlin_kotlin.$_$.r;
-  var toMap = kotlin_kotlin.$_$.w5;
   var PrimitiveClasses_getInstance = kotlin_kotlin.$_$.o;
   var KtList = kotlin_kotlin.$_$.e2;
-  var getKClass = kotlin_kotlin.$_$.p9;
+  var getKClass = kotlin_kotlin.$_$.q9;
   var ArrayList = kotlin_kotlin.$_$.a2;
   var KtMap = kotlin_kotlin.$_$.f2;
   var LinkedHashMap = kotlin_kotlin.$_$.c2;
-  var Char = kotlin_kotlin.$_$.sd;
+  var Char = kotlin_kotlin.$_$.rd;
   var BigInteger = kotlin_io_github_gciatto_kt_math.$_$.g;
   var BigDecimal = kotlin_io_github_gciatto_kt_math.$_$.f;
   var arrayConcat = kotlin_kotlin.$_$.a;
+  var listOf = kotlin_kotlin.$_$.h4;
+  var Signature = kotlin_it_unibo_tuprolog_solve.$_$.l4;
+  var to = kotlin_kotlin.$_$.we;
+  var mapOf = kotlin_kotlin.$_$.k4;
+  var AbstractLibrary = kotlin_it_unibo_tuprolog_solve.$_$.w2;
+  var collectionSizeOrDefault = kotlin_kotlin.$_$.w2;
+  var ArrayList_init_$Create$ = kotlin_kotlin.$_$.t;
+  var Unit_instance = kotlin_kotlin.$_$.r;
+  var toMap = kotlin_kotlin.$_$.y5;
   var Specifier_XFY_getInstance = kotlin_it_unibo_tuprolog_core.$_$.c;
   var Operator = kotlin_it_unibo_tuprolog_core.$_$.n1;
   var Specifier_XFX_getInstance = kotlin_it_unibo_tuprolog_core.$_$.b;
   var Specifier_FX_getInstance = kotlin_it_unibo_tuprolog_core.$_$.a;
   var OperatorSet_init_$Create$ = kotlin_it_unibo_tuprolog_core.$_$.j1;
-  var initMetadataForObject = kotlin_kotlin.$_$.f8;
-  var getKClassFromExpression = kotlin_kotlin.$_$.o9;
-  var initMetadataForCompanion = kotlin_kotlin.$_$.b8;
+  var asSequence = kotlin_kotlin.$_$.r2;
+  var documentationOf = kotlin_it_unibo_tuprolog_solve.$_$.y2;
+  var mergeDocumentation = kotlin_it_unibo_tuprolog_solve.$_$.z2;
+  var initMetadataForObject = kotlin_kotlin.$_$.g8;
+  var getKClassFromExpression = kotlin_kotlin.$_$.p9;
+  var initMetadataForCompanion = kotlin_kotlin.$_$.c8;
   var Atom = kotlin_it_unibo_tuprolog_core.$_$.o1;
-  var KProperty1 = kotlin_kotlin.$_$.s9;
-  var getPropertyCallableRef = kotlin_kotlin.$_$.x7;
-  var constructCallableReference = kotlin_kotlin.$_$.q7;
-  var isInterface = kotlin_kotlin.$_$.j8;
+  var KProperty1 = kotlin_kotlin.$_$.t9;
+  var getPropertyCallableRef = kotlin_kotlin.$_$.y7;
+  var constructCallableReference = kotlin_kotlin.$_$.r7;
+  var isInterface = kotlin_kotlin.$_$.k8;
   var lazy = kotlin_kotlin.$_$.pe;
   var toString = kotlin_kotlin.$_$.ve;
-  var hashCode = kotlin_kotlin.$_$.z7;
-  var equals = kotlin_kotlin.$_$.s7;
-  var initMetadataForClass = kotlin_kotlin.$_$.a8;
+  var hashCode = kotlin_kotlin.$_$.a8;
+  var equals = kotlin_kotlin.$_$.t7;
+  var initMetadataForClass = kotlin_kotlin.$_$.b8;
   var Companion_instance = kotlin_it_unibo_tuprolog_utils.$_$.e;
   var contains = kotlin_kotlin.$_$.x2;
-  var listOf_0 = kotlin_kotlin.$_$.f4;
+  var listOf_0 = kotlin_kotlin.$_$.g4;
   var checkIndexOverflow = kotlin_kotlin.$_$.v2;
   var copyToArray = kotlin_kotlin.$_$.g3;
-  var toString_0 = kotlin_kotlin.$_$.u8;
-  var trimMargin = kotlin_kotlin.$_$.od;
+  var toString_0 = kotlin_kotlin.$_$.v8;
+  var trimMargin = kotlin_kotlin.$_$.nd;
   var IllegalArgumentException_init_$Create$ = kotlin_kotlin.$_$.j1;
-  var setOf = kotlin_kotlin.$_$.f5;
+  var setOf = kotlin_kotlin.$_$.g5;
   var Companion_instance_0 = kotlin_it_unibo_tuprolog_core.$_$.z;
   var format = kotlin_it_unibo_tuprolog_core.$_$.c3;
-  var captureStack = kotlin_kotlin.$_$.i7;
-  var Companion_instance_1 = kotlin_it_unibo_tuprolog_solve.$_$.d1;
-  var Expected_DEALIASING_EXPRESSION_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.l;
-  var charSequenceLength = kotlin_kotlin.$_$.n7;
-  var charCodeAt = kotlin_kotlin.$_$.l7;
+  var captureStack = kotlin_kotlin.$_$.j7;
+  var Companion_instance_1 = kotlin_it_unibo_tuprolog_solve.$_$.e1;
+  var Expected_DEALIASING_EXPRESSION_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.m;
+  var charSequenceLength = kotlin_kotlin.$_$.o7;
+  var charCodeAt = kotlin_kotlin.$_$.m7;
   var toString_1 = kotlin_kotlin.$_$.h;
-  var substring = kotlin_kotlin.$_$.bd;
+  var substring = kotlin_kotlin.$_$.ad;
   var Companion_getInstance = kotlin_it_unibo_tuprolog_unify.$_$.a;
   var Struct = kotlin_it_unibo_tuprolog_core.$_$.z1;
-  var Companion_instance_2 = kotlin_it_unibo_tuprolog_solve.$_$.x;
+  var Companion_instance_2 = kotlin_it_unibo_tuprolog_solve.$_$.y;
   var ObjectType_OOP_ALIAS_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.h;
   var TuPrologException_init_$Init$ = kotlin_it_unibo_tuprolog_core.$_$.i1;
   var TuPrologException = kotlin_it_unibo_tuprolog_core.$_$.l1;
-  var objectCreate = kotlin_kotlin.$_$.q8;
-  var Companion_instance_3 = kotlin_it_unibo_tuprolog_solve.$_$.a1;
-  var Limit_OOP_OBJECT_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.j;
+  var objectCreate = kotlin_kotlin.$_$.r8;
+  var Companion_instance_3 = kotlin_it_unibo_tuprolog_solve.$_$.b1;
+  var Limit_OOP_OBJECT_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.k;
   var Companion_getInstance_0 = kotlin_it_unibo_tuprolog_core.$_$.m;
-  var THROW_CCE = kotlin_kotlin.$_$.ge;
+  var THROW_CCE = kotlin_kotlin.$_$.fe;
   var Term = kotlin_it_unibo_tuprolog_core.$_$.y2;
   var NumberTypeTester = kotlin_it_unibo_tuprolog_utils.$_$.l;
   var Companion_getInstance_1 = kotlin_it_unibo_tuprolog_core.$_$.a1;
-  var charArrayOf = kotlin_kotlin.$_$.j7;
-  var concatToString = kotlin_kotlin.$_$.tb;
+  var charArrayOf = kotlin_kotlin.$_$.k7;
+  var concatToString = kotlin_kotlin.$_$.rb;
   var Companion_getInstance_2 = kotlin_it_unibo_tuprolog_core.$_$.u;
   var Companion_getInstance_3 = kotlin_it_unibo_tuprolog_core.$_$.r;
-  var isNumber = kotlin_kotlin.$_$.k8;
-  var Exception = kotlin_kotlin.$_$.xd;
+  var isNumber = kotlin_kotlin.$_$.l8;
+  var Exception = kotlin_kotlin.$_$.wd;
   var Var = kotlin_it_unibo_tuprolog_core.$_$.b3;
-  var sequenceOf = kotlin_kotlin.$_$.cb;
-  var plus = kotlin_kotlin.$_$.za;
+  var sequenceOf = kotlin_kotlin.$_$.ab;
+  var plus = kotlin_kotlin.$_$.ya;
   var Companion_getInstance_4 = kotlin_io_github_gciatto_kt_math.$_$.e;
   var Companion_getInstance_5 = kotlin_io_github_gciatto_kt_math.$_$.d;
-  var compareTo = kotlin_kotlin.$_$.p7;
+  var compareTo = kotlin_kotlin.$_$.q7;
   var Integer = kotlin_it_unibo_tuprolog_core.$_$.u1;
-  var sequenceOf_0 = kotlin_kotlin.$_$.bb;
+  var sequenceOf_0 = kotlin_kotlin.$_$.za;
   var Real = kotlin_it_unibo_tuprolog_core.$_$.x1;
   var Truth = kotlin_it_unibo_tuprolog_core.$_$.z2;
   var first = kotlin_kotlin.$_$.ia;
-  var toSet = kotlin_kotlin.$_$.lb;
+  var toSet = kotlin_kotlin.$_$.jb;
   var Some = kotlin_it_unibo_tuprolog_utils.$_$.m;
   var Companion_getInstance_6 = kotlin_it_unibo_tuprolog_core.$_$.y;
-  var Companion_getInstance_7 = kotlin_it_unibo_tuprolog_solve.$_$.l1;
-  var Functional = kotlin_it_unibo_tuprolog_solve.$_$.g3;
-  var Companion_instance_4 = kotlin_it_unibo_tuprolog_solve.$_$.c1;
-  var Functional_0 = kotlin_it_unibo_tuprolog_solve.$_$.x2;
-  var Expected_OBJECT_REFERENCE_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.n;
-  var map = kotlin_kotlin.$_$.ua;
+  var Companion_getInstance_7 = kotlin_it_unibo_tuprolog_solve.$_$.n1;
+  var Functional = kotlin_it_unibo_tuprolog_solve.$_$.i3;
+  var Companion_instance_4 = kotlin_it_unibo_tuprolog_solve.$_$.d1;
+  var ResolutionException = kotlin_it_unibo_tuprolog_solve.$_$.t2;
+  var Functional_0 = kotlin_it_unibo_tuprolog_solve.$_$.a3;
+  var Expected_OBJECT_REFERENCE_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.o;
+  var map = kotlin_kotlin.$_$.ta;
   var Companion_instance_5 = kotlin_it_unibo_tuprolog_core.$_$.s;
   var List = kotlin_it_unibo_tuprolog_core.$_$.v1;
-  var toList = kotlin_kotlin.$_$.jb;
-  var isArray = kotlin_kotlin.$_$.g8;
-  var asSequence = kotlin_kotlin.$_$.s2;
-  var Predicative = kotlin_it_unibo_tuprolog_solve.$_$.i3;
-  var TernaryRelation = kotlin_it_unibo_tuprolog_solve.$_$.k3;
-  var asSequence_0 = kotlin_kotlin.$_$.r2;
+  var toList = kotlin_kotlin.$_$.hb;
+  var isArray = kotlin_kotlin.$_$.h8;
+  var asSequence_0 = kotlin_kotlin.$_$.s2;
+  var Predicative = kotlin_it_unibo_tuprolog_solve.$_$.k3;
+  var TernaryRelation = kotlin_it_unibo_tuprolog_solve.$_$.m3;
   var flatMap = kotlin_kotlin.$_$.ja;
-  var distinct = kotlin_kotlin.$_$.aa;
-  var TypeTester = kotlin_it_unibo_tuprolog_solve.$_$.l3;
-  var Expected_TYPE_REFERENCE_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.p;
-  var Expected_REFERENCE_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.o;
+  var distinct = kotlin_kotlin.$_$.ba;
+  var TypeTester = kotlin_it_unibo_tuprolog_solve.$_$.n3;
+  var Expected_TYPE_REFERENCE_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.q;
+  var Expected_REFERENCE_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.p;
   var Companion_getInstance_8 = kotlin_it_unibo_tuprolog_core.$_$.c1;
   var Companion_getInstance_9 = kotlin_it_unibo_tuprolog_core.$_$.x;
   var filter = kotlin_kotlin.$_$.ga;
-  var Sequence = kotlin_kotlin.$_$.u9;
+  var Sequence = kotlin_kotlin.$_$.v9;
   var firstOrNull = kotlin_kotlin.$_$.ha;
-  var Yes = kotlin_it_unibo_tuprolog_solve.$_$.m4;
-  var NonBacktrackable = kotlin_it_unibo_tuprolog_solve.$_$.y2;
-  var Companion_instance_6 = kotlin_it_unibo_tuprolog_solve.$_$.y;
+  var Yes = kotlin_it_unibo_tuprolog_solve.$_$.o4;
+  var NonBacktrackable = kotlin_it_unibo_tuprolog_solve.$_$.b3;
+  var Companion_instance_6 = kotlin_it_unibo_tuprolog_solve.$_$.z;
   var KtSet = kotlin_kotlin.$_$.g2;
-  var NonBacktrackable_0 = kotlin_it_unibo_tuprolog_solve.$_$.m3;
-  var RuleWrapper = kotlin_it_unibo_tuprolog_solve.$_$.p3;
-  var RuleWrapper_init_$Init$ = kotlin_it_unibo_tuprolog_solve.$_$.j2;
-  var Var_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.o1;
-  var getStringHashCode = kotlin_kotlin.$_$.y7;
-  var toString_2 = kotlin_kotlin.$_$.ld;
-  var ensureNotNull = kotlin_kotlin.$_$.me;
+  var NonBacktrackable_0 = kotlin_it_unibo_tuprolog_solve.$_$.o3;
+  var RuleWrapper = kotlin_it_unibo_tuprolog_solve.$_$.r3;
+  var RuleWrapper_init_$Init$ = kotlin_it_unibo_tuprolog_solve.$_$.k2;
+  var Var_getInstance = kotlin_it_unibo_tuprolog_solve.$_$.q1;
+  var getStringHashCode = kotlin_kotlin.$_$.z7;
+  var toString_2 = kotlin_kotlin.$_$.kd;
+  var ensureNotNull = kotlin_kotlin.$_$.le;
   var _Char___init__impl__6a9atx = kotlin_kotlin.$_$.c;
-  var split = kotlin_kotlin.$_$.vc;
-  var get_kotlin = kotlin_kotlin.$_$.l8;
-  var NotImplementedError = kotlin_kotlin.$_$.be;
+  var split = kotlin_kotlin.$_$.tc;
+  var get_kotlin = kotlin_kotlin.$_$.m8;
+  var NotImplementedError = kotlin_kotlin.$_$.ae;
   var Regex_init_$Create$ = kotlin_kotlin.$_$.z;
   //endregion
   //region block: pre-declaration
@@ -243,13 +248,23 @@
   //endregion
   function NullRef() {
   }
+  function _get_ruleWrappers__mybpf3($this) {
+    return listOf(arrayConcat([[Cast_getInstance_0(), Invocation_getInstance(), Assignment_getInstance(), Dot_getInstance(), Recursive_getInstance(), Couple_getInstance(), Trivial_getInstance(), NewObject2_getInstance(), Recursive_getInstance_0(), Base_getInstance(), Companion_instance_15.forType_lwe2s5_k$('string', PrimitiveClasses_getInstance().get_stringClass_bik2gy_k$()), Companion_instance_15.forType_lwe2s5_k$('array', PrimitiveClasses_getInstance().get_arrayClass_udg0fc_k$()), Companion_instance_15.forType_lwe2s5_k$('list', getKClass(KtList)), Companion_instance_15.forType_lwe2s5_k$('arraylist', getKClass(ArrayList)), Companion_instance_15.forType_lwe2s5_k$('map', getKClass(KtMap)), Companion_instance_15.forType_lwe2s5_k$('hashmap', getKClass(LinkedHashMap)), Companion_instance_15.forType_lwe2s5_k$('int', PrimitiveClasses_getInstance().get_intClass_mw4y9a_k$()), Companion_instance_15.forType_lwe2s5_k$('integer', PrimitiveClasses_getInstance().get_intClass_mw4y9a_k$()), Companion_instance_15.forType_lwe2s5_k$('double', PrimitiveClasses_getInstance().get_doubleClass_dahzcy_k$()), Companion_instance_15.forType_lwe2s5_k$('float', PrimitiveClasses_getInstance().get_floatClass_xlwq2t_k$()), Companion_instance_15.forType_lwe2s5_k$('long', PrimitiveClasses_getInstance().get_longClass_a79cj7_k$()), Companion_instance_15.forType_lwe2s5_k$('short', PrimitiveClasses_getInstance().get_shortClass_5ajsv9_k$()), Companion_instance_15.forType_lwe2s5_k$('byte', PrimitiveClasses_getInstance().get_byteClass_pu7s61_k$()), Companion_instance_15.forType_lwe2s5_k$('char', getKClass(Char)), Companion_instance_15.forType_lwe2s5_k$('bool', PrimitiveClasses_getInstance().get_booleanClass_d285fr_k$()), Companion_instance_15.forType_lwe2s5_k$('boolean', PrimitiveClasses_getInstance().get_booleanClass_d285fr_k$()), Companion_instance_15.forType_lwe2s5_k$('any', PrimitiveClasses_getInstance().get_anyClass_x0jl4l_k$()), Companion_instance_15.forType_lwe2s5_k$('nothing', PrimitiveClasses_getInstance().get_nothingClass_7ivpcc_k$()), Companion_instance_15.forType_lwe2s5_k$('big_integer', getKClass(BigInteger)), Companion_instance_15.forType_lwe2s5_k$('big_decimal', getKClass(BigDecimal))], get_platformSpecificAliases()]));
+  }
+  function _get_operatorDocumentation__vy55az($this) {
+    return mapOf([to(new Signature('$', 1), "`$+Alias`\n\nAlias reference, with no predicate behind it: `$Alias` stands for the object or type reference registered under the atom `Alias` by an `alias/2` fact, i.e. one of the library's default aliases (`string`, `int`, `arraylist`, `stdout`, ...) or one added via `register/2`. It is resolved by the library wherever a reference is expected: as the receiver of `invoke_method/3`, `invoke_strict/3`, `./2` and `:=/2`, as the type of `new_object/2,3` and `cast/3`, as the value of `assign/3`, as the type in `as/2` casts, and inside method or constructor arguments (where it must denote an object). An unregistered alias raises an existence error.\n\n**Examples**\n\n```prolog\n?- $stdout.println(hello).\n% prints: hello\nyes.\n\n?- new_object($arraylist, L), L.add(a), N := L.size.\nN = 1.\n\n?- invoke_method($nope, toString, R).\nthrows error(existence_error(_, _), _).\n```"), to(new Signature('as', 2), "`+Term as +Type`\n\nExplicit conversion, with no predicate behind it. Inside method or constructor arguments (of `invoke_method/3`, `invoke_strict/3`, `new_object/3`, `./2` chains, `*_items/2` lists and `assign/3` values), `Term as Type` converts `Term` into exactly `Type` instead of the automatically inferred type, which also steers overload selection. There `Type` is an atom holding a fully qualified type name (e.g. `'java.lang.Long'`), a type reference, or a `$Alias` reference to a type; if `Term` cannot be represented as `Type`, an error is raised. On the right of `:=/2`, `Result := Term as Type` instead calls `cast/3`, which requires a type reference or a `$Alias`. Since `as` binds tighter than `.`, parenthesise chains: `R := (Obj.size) as $long`.\n\n**Examples**\n\n```prolog\n?- X := $math.max(1 as 'java.lang.Double', 2).\nX = 2.0.\n\n?- new_object('java.util.ArrayList', [], L), L.add(1 as 'java.lang.Long'), A := L.contains(1 as 'java.lang.Long'), B := L.contains(1).\nA = true, B = false.\n\n?- new_object('java.util.ArrayList', [], L), L.add(abc as 'java.lang.Long').\nthrows error(representation_error(_), _).\n```")]);
+  }
   function OOPLib() {
     OOPLib_instance = this;
     AbstractLibrary.call(this);
+    this.help_1 = "`library('prolog.oop')`\n\nBridges Prolog with the JVM/Kotlin object world via reflection: Prolog code can create objects, call their (possibly overloaded) methods and constructors, read and write their properties, and convert values back and forth. Objects and classes are represented by opaque reference terms (see `object_ref/1`, `type_ref/1`, `null_ref/1`); Prolog atoms, numbers and booleans are converted automatically to and from strings, numbers and booleans.\n\nMain entry points are `new_object/2,3` (instantiation), `invoke_method/3` and `invoke_strict/3` (method calls), `assign/3` (property writes), `cast/3` and `type/2` (types and conversions), `array_items/2`, `list_items/2` and `set_items/2` (collections), and `register/2`/`unregister/1` (aliases, see `alias/2`).\n\nThe operators `./2` (method call or property read, chainable), `:=/2` (capture a result or assign a property), `as/2` (explicit conversion) and `$/1` (alias reference, e.g. `$stdout`) provide a fluent syntax on top of these predicates. Example: `new_object('java.util.ArrayList', [], L), L.add(1 as 'java.lang.Long'), N := L.size, $stdout.println(N)`. Reflective invocation is only available on the JVM.";
   }
   protoOf(OOPLib).get_alias_iooo4n_k$ = function () {
     return 'prolog.oop';
   };
+  protoOf(OOPLib).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(OOPLib).get_primitives_xl08ol_k$ = function () {
     // Inline function 'kotlin.collections.map' call
     var this_0 = listOf([ArrayItems_getInstance(), Assign_getInstance(), Cast_getInstance(), Type_getInstance(), InvokeMethod_getInstance(), InvokeStrict_getInstance(), ListItems_getInstance(), NewObject3_getInstance(), NullRef_getInstance(), ObjectRef_getInstance(), Ref_getInstance(), Register_getInstance(), SetItems_getInstance(), TypeRef_getInstance(), Unregister_getInstance()]);
@@ -266,7 +281,7 @@
   };
   protoOf(OOPLib).get_clauses_fdta0r_k$ = function () {
     // Inline function 'kotlin.collections.map' call
-    var this_0 = listOf(arrayConcat([[Cast_getInstance_0(), Invocation_getInstance(), Assignment_getInstance(), Dot_getInstance(), Recursive_getInstance(), Couple_getInstance(), Trivial_getInstance(), NewObject2_getInstance(), Recursive_getInstance_0(), Base_getInstance(), Companion_instance_15.forType_lwe2s5_k$('string', PrimitiveClasses_getInstance().get_stringClass_bik2gy_k$()), Companion_instance_15.forType_lwe2s5_k$('array', PrimitiveClasses_getInstance().get_arrayClass_udg0fc_k$()), Companion_instance_15.forType_lwe2s5_k$('list', getKClass(KtList)), Companion_instance_15.forType_lwe2s5_k$('arraylist', getKClass(ArrayList)), Companion_instance_15.forType_lwe2s5_k$('map', getKClass(KtMap)), Companion_instance_15.forType_lwe2s5_k$('hashmap', getKClass(LinkedHashMap)), Companion_instance_15.forType_lwe2s5_k$('int', PrimitiveClasses_getInstance().get_intClass_mw4y9a_k$()), Companion_instance_15.forType_lwe2s5_k$('integer', PrimitiveClasses_getInstance().get_intClass_mw4y9a_k$()), Companion_instance_15.forType_lwe2s5_k$('double', PrimitiveClasses_getInstance().get_doubleClass_dahzcy_k$()), Companion_instance_15.forType_lwe2s5_k$('float', PrimitiveClasses_getInstance().get_floatClass_xlwq2t_k$()), Companion_instance_15.forType_lwe2s5_k$('long', PrimitiveClasses_getInstance().get_longClass_a79cj7_k$()), Companion_instance_15.forType_lwe2s5_k$('short', PrimitiveClasses_getInstance().get_shortClass_5ajsv9_k$()), Companion_instance_15.forType_lwe2s5_k$('byte', PrimitiveClasses_getInstance().get_byteClass_pu7s61_k$()), Companion_instance_15.forType_lwe2s5_k$('char', getKClass(Char)), Companion_instance_15.forType_lwe2s5_k$('bool', PrimitiveClasses_getInstance().get_booleanClass_d285fr_k$()), Companion_instance_15.forType_lwe2s5_k$('boolean', PrimitiveClasses_getInstance().get_booleanClass_d285fr_k$()), Companion_instance_15.forType_lwe2s5_k$('any', PrimitiveClasses_getInstance().get_anyClass_x0jl4l_k$()), Companion_instance_15.forType_lwe2s5_k$('nothing', PrimitiveClasses_getInstance().get_nothingClass_7ivpcc_k$()), Companion_instance_15.forType_lwe2s5_k$('big_integer', getKClass(BigInteger)), Companion_instance_15.forType_lwe2s5_k$('big_decimal', getKClass(BigDecimal))], get_platformSpecificAliases()]));
+    var this_0 = _get_ruleWrappers__mybpf3(this);
     // Inline function 'kotlin.collections.mapTo' call
     var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
     var _iterator__ex2g4s = this_0.iterator_jk1svi_k$();
@@ -280,6 +295,9 @@
   protoOf(OOPLib).get_operators_z0nmfu_k$ = function () {
     return OperatorSet_init_$Create$([new Operator('.', Specifier_XFY_getInstance(), 800), new Operator(':=', Specifier_XFX_getInstance(), 850), new Operator('as', Specifier_XFX_getInstance(), 200), new Operator('$', Specifier_FX_getInstance(), 100)]);
   };
+  protoOf(OOPLib).get_documentation_p1cqdt_k$ = function () {
+    return mergeDocumentation([protoOf(AbstractLibrary).get_documentation_p1cqdt_k$.call(this), documentationOf(asSequence(_get_ruleWrappers__mybpf3(this))), _get_operatorDocumentation__vy55az(this)]);
+  };
   var OOPLib_instance;
   function OOPLib_getInstance() {
     if (OOPLib_instance == null)
@@ -350,7 +368,7 @@
   function Result$Value$_get_termValue_$ref_u3cirl() {
     return constructCallableReference(function (p0) {
       return _get_termValue__ikgccs(p0);
-    }, 1, 0, 136);
+    }, 1, 0, 130);
   }
   function Result$Value$objectRef$delegate$lambda(this$0) {
     return function () {
@@ -368,7 +386,7 @@
   function Result$Value$_get_objectRef_$ref_8a6ozy() {
     return constructCallableReference(function (p0) {
       return _get_objectRef__3zhern(p0);
-    }, 1, 0, 137);
+    }, 1, 0, 131);
   }
   function Value(value) {
     Result.call(this);
@@ -1357,19 +1375,27 @@
       if (typeof source === 'string') {
         tmp = Companion_getInstance_0().of(source);
       } else {
-        if (isNumber(source)) {
-          tmp = $this$with.get_isInteger_cpv3bm_k$(source) ? Companion_getInstance_3().ofBigInteger($this$with.toInteger_cr7ezq_k$(source)) : Companion_getInstance_2().ofBigDecimal($this$with.toDecimal_f0xy7b_k$(source));
+        if (isInterface(source, BigInteger)) {
+          tmp = Companion_getInstance_3().ofBigInteger(source);
         } else {
-          if (source instanceof Char) {
-            var tmp_0 = Companion_getInstance_0();
-            // Inline function 'kotlin.charArrayOf' call
-            var tmp$ret$2 = charArrayOf([source.value_1]);
-            tmp = tmp_0.of(concatToString(tmp$ret$2));
+          if (isInterface(source, BigDecimal)) {
+            tmp = Companion_getInstance_2().ofBigDecimal(source);
           } else {
-            if (typeof source === 'boolean') {
-              tmp = Companion_getInstance_1().of(source);
+            if (isNumber(source)) {
+              tmp = $this$with.get_isInteger_cpv3bm_k$(source) ? Companion_getInstance_3().ofBigInteger($this$with.toInteger_cr7ezq_k$(source)) : Companion_getInstance_2().ofBigDecimal($this$with.toDecimal_f0xy7b_k$(source));
             } else {
-              tmp = Companion_getInstance_10().of_u40ndk_k$(source);
+              if (source instanceof Char) {
+                var tmp_0 = Companion_getInstance_0();
+                // Inline function 'kotlin.charArrayOf' call
+                var tmp$ret$2 = charArrayOf([source.value_1]);
+                tmp = tmp_0.of(concatToString(tmp$ret$2));
+              } else {
+                if (typeof source === 'boolean') {
+                  tmp = Companion_getInstance_1().of(source);
+                } else {
+                  tmp = Companion_getInstance_10().of_u40ndk_k$(source);
+                }
+              }
             }
           }
         }
@@ -2052,11 +2078,16 @@
           var e = $p;
           throw e.toLogicError_fiiu4e_k$(_this__u8e3s4.context, _this__u8e3s4.signature);
         } else {
-          if ($p instanceof Error) {
+          if ($p instanceof ResolutionException) {
             var e_0 = $p;
-            throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_0);
+            throw e_0;
           } else {
-            throw $p;
+            if ($p instanceof Error) {
+              var e_1 = $p;
+              throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_1);
+            } else {
+              throw $p;
+            }
           }
         }
       }
@@ -2122,7 +2153,11 @@
   function ArrayItems() {
     ArrayItems_instance = this;
     AbstractIterableItems.call(this, 'array', PrimitiveClasses_getInstance().get_arrayClass_udg0fc_k$());
+    this.help_1 = "`array_items(?ArrayRef, ?Items)`\n\nConverts between a Prolog list `Items` and an object reference `ArrayRef` wrapping a JVM/Kotlin array (`Object[]`) with the same elements. If `Items` is a list, each item is converted to an object (respecting `as` casts and `$Alias` references) and `ArrayRef` is unified with a reference to a fresh array; otherwise, if `ArrayRef` references an array, `Items` is unified with the list of its elements converted back to terms: strings become atoms, numbers become Prolog numbers, and other objects stay object references. Deterministic. Raises an instantiation error if both arguments are unbound, and a type error if `ArrayRef` is neither unbound nor an object reference; fails if it references something that is not an array.\n\n**Examples**\n\n```prolog\n?- array_items(A, [a, b, c]), array_items(A, L).\nL = [a, b, c].\n\n?- array_items(A, [1, 2.5]), array_items(A, L).\nL = [1, 2.5].\n\n?- new_object('java.util.ArrayList', [], L), array_items(L, Items).\nno.\n\n?- array_items(A, L).\nthrows error(instantiation_error, _).\n```";
   }
+  protoOf(ArrayItems).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(ArrayItems).toIterable_j8vuup_k$ = function (_this__u8e3s4) {
     // Inline function 'kotlin.collections.toTypedArray' call
     var this_0 = toList(_this__u8e3s4);
@@ -2132,7 +2167,7 @@
     return !(_this__u8e3s4 == null) ? isArray(_this__u8e3s4) : false;
   };
   protoOf(ArrayItems).get_items_dh9b15_k$ = function (_this__u8e3s4) {
-    return asSequence(_this__u8e3s4);
+    return asSequence_0(_this__u8e3s4);
   };
   protoOf(ArrayItems).get_items_ay3mtl_k$ = function (_this__u8e3s4) {
     return this.get_items_dh9b15_k$(isArray(_this__u8e3s4) ? _this__u8e3s4 : THROW_CCE());
@@ -2146,7 +2181,11 @@
   function Assign() {
     Assign_instance = this;
     Predicative.call(this, 'assign');
+    this.help_1 = "`assign(+Ref, +Property, +Value)`\n\nWrites `Value` into the public mutable property named `Property` of the object (or, for a type reference, the static/companion member) referenced by `Ref`. `Ref` must be an object or type reference (not a `$Alias` term); `Value` is converted to the property's type (it may use `as` casts or be a `$Alias` reference). If several properties share the name, the one whose type best fits `Value` is chosen. Succeeds once. Raises a type error if `Ref` is not a reference or `Property` is not an atom, an existence error if no suitable mutable property exists, and a representation error if `Value` cannot be converted. This is what `Obj.prop := Value` (see `:=/2`) lowers to.\n\n**Examples**\n\n```prolog\n?- new_object('java.awt.Point', [1, 2], P), assign(P, x, 5), X := P.x.\nX = 5.\n\n?- new_object('java.awt.Point', [1, 2], P), assign(P, nope, 5).\nthrows error(existence_error(_, _), _).\n\n?- assign(foo, x, 5).\nthrows error(type_error(_, foo), _).\n```";
   }
+  protoOf(Assign).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(Assign).compute_ndmwim_k$ = function (_this__u8e3s4, first, second, third) {
     Companion_getInstance_7().ensuringArgumentIsAtom_5kuj97_k$(_this__u8e3s4, 0);
     Companion_getInstance_7().ensuringArgumentIsAtom_5kuj97_k$(_this__u8e3s4, 1);
@@ -2176,11 +2215,16 @@
           var e = $p;
           throw e.toLogicError_fiiu4e_k$(_this__u8e3s4.context, _this__u8e3s4.signature);
         } else {
-          if ($p instanceof Error) {
+          if ($p instanceof ResolutionException) {
             var e_0 = $p;
-            throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_0);
+            throw e_0;
           } else {
-            throw $p;
+            if ($p instanceof Error) {
+              var e_1 = $p;
+              throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_1);
+            } else {
+              throw $p;
+            }
           }
         }
       }
@@ -2222,7 +2266,11 @@
   function Cast() {
     Cast_instance = this;
     TernaryRelation.call(this, 'cast');
+    this.help_1 = '`cast(+Term, ?Type, ?ObjectRef)`\n\nConverts `Term` into an instance of `Type` and unifies `ObjectRef` with a reference to the resulting object. `Type` must be a type reference or a `$Alias` reference to a type (e.g. `$long`); any other bound value raises a type error, and an unregistered alias raises an existence error. Fails if `Term` cannot be converted into `Type`. If `Type` is unbound, it enumerates on backtracking every type `Term` can be converted into (and all their supertypes), binding `Type` to a type reference each time. Use it to force a specific representation, e.g. `cast(1, $long, L)` yields a reference to a `Long` rather than an `Int`; inside method or constructor arguments, the `X as Type` notation (`as/2`) forces a conversion inline.\n\n**Examples**\n\n```prolog\n?- cast(1, $long, R), object_ref(R).\nyes.\n\n?- cast(abc, $int, R).\nno.\n```';
   }
+  protoOf(Cast).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(Cast).computeAll_icj3zj_k$ = function (_this__u8e3s4, first, second, third) {
     var tmp$ret$0;
     $l$block: {
@@ -2249,7 +2297,7 @@
           tmp = tmp_0;
         } else {
           if (isInterface(second, Var)) {
-            var tmp_3 = asSequence_0(get_termToObjectConverter(_this__u8e3s4).admissibleTypes_1kwmul_k$(first));
+            var tmp_3 = asSequence(get_termToObjectConverter(_this__u8e3s4).admissibleTypes_1kwmul_k$(first));
             var tmp_4 = distinct(flatMap(tmp_3, Cast$computeAll$lambda));
             var tmp_5 = map(tmp_4, Cast$computeAll$lambda_0(_this__u8e3s4, first, third, second));
             tmp = map(tmp_5, Cast$computeAll$lambda_1(_this__u8e3s4));
@@ -2265,11 +2313,16 @@
           var e = $p_0;
           throw e.toLogicError_fiiu4e_k$(_this__u8e3s4.context, _this__u8e3s4.signature);
         } else {
-          if ($p_0 instanceof Error) {
+          if ($p_0 instanceof ResolutionException) {
             var e_0 = $p_0;
-            throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_0);
+            throw e_0;
           } else {
-            throw $p_0;
+            if ($p_0 instanceof Error) {
+              var e_1 = $p_0;
+              throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_1);
+            } else {
+              throw $p_0;
+            }
           }
         }
       }
@@ -2288,7 +2341,11 @@
   function InvokeMethod() {
     InvokeMethod_instance = this;
     AbstractInvoke.call(this, 'method');
+    this.help_1 = "`invoke_method(+Ref, +Method, ?Result)`\n\nInvokes a public member of the object referenced by `Ref` and unifies `Result` with the returned value, converted to a plain term when possible: strings and characters become atoms, numbers become numbers, booleans become `true`/`false`, `null` becomes the null reference, and any other object stays an object reference. `Ref` may be an object reference, a type reference (to call static or companion-object members) or a `$Alias` reference; `Method` is an atom (no arguments; also reads a property) or a compound `name(Arg1, ..., ArgN)`. Arguments are converted to objects and the best-matching overload is selected; use `as` casts to steer the choice. Succeeds once. Raises a type error if `Ref` is neither a reference nor a `$Alias` term, an existence error if the alias is not registered or no suitable method exists, a representation error if an argument cannot be converted, and a system error if the method itself throws. This is what `Obj.method(...)` (see `./2`) lowers to.\n\n**Examples**\n\n```prolog\n?- invoke_method($math, max(1, 2), M).\nM = 2.\n\n?- new_object('java.lang.StringBuilder', [abc], B), invoke_method(B, reverse, R), invoke_method(R, toString, S).\nS = cba.\n\n?- invoke_method($math, nope, M).\nthrows error(existence_error(_, _), _).\n\n?- invoke_method(foo, toString, R).\nthrows error(type_error(_, foo), _).\n```";
   }
+  protoOf(InvokeMethod).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(InvokeMethod).getInvocationResult_3mb3ft_k$ = function (_this__u8e3s4) {
     return _this__u8e3s4.toTerm_edaxrt_k$();
   };
@@ -2301,7 +2358,11 @@
   function InvokeStrict() {
     InvokeStrict_instance = this;
     AbstractInvoke.call(this, 'strict');
+    this.help_1 = "`invoke_strict(+Ref, +Method, ?Result)`\n\nLike `invoke_method/3`, but `Result` is always unified with an object reference wrapping the returned value, even when it could be converted to a plain term (e.g. a string or number stays a reference). Useful to keep calling methods on the result with its exact runtime type preserved, e.g. a `String` you want to keep manipulating as a JVM object. Accepts the same `Ref` and `Method` shapes, and raises the same errors, as `invoke_method/3`.\n\n**Examples**\n\n```prolog\n?- new_object('java.lang.StringBuilder', [abc], B), invoke_strict(B, toString, S), object_ref(S), N := S.length.\nN = 3.\n\n?- new_object('java.lang.StringBuilder', [abc], B), invoke_method(B, toString, S).\nS = abc.\n\n?- invoke_strict($math, nope, R).\nthrows error(existence_error(_, _), _).\n```";
   }
+  protoOf(InvokeStrict).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(InvokeStrict).getInvocationResult_3mb3ft_k$ = function (_this__u8e3s4) {
     return _this__u8e3s4.asObjectRef_ji97lu_k$();
   };
@@ -2314,7 +2375,11 @@
   function ListItems() {
     ListItems_instance = this;
     AbstractIterableItems.call(this, 'list', getKClass(KtList));
+    this.help_1 = "`list_items(?ListRef, ?Items)`\n\nConverts between a Prolog list `Items` and an object reference `ListRef` wrapping a JVM/Kotlin `List` with the same elements. If `Items` is a list, each item is converted to an object (respecting `as` casts and `$Alias` references) and `ListRef` is unified with a reference to a fresh list; otherwise, if `ListRef` references a `List`, `Items` is unified with its elements converted back to terms. Deterministic. Raises an instantiation error if both arguments are unbound, and a type error if `ListRef` is neither unbound nor an object reference; fails if it references something that is not a `List`.\n\n**Examples**\n\n```prolog\n?- list_items(L, [a, b]), N := L.size.\nN = 2.\n\n?- list_items(L, [1, 2.5]), list_items(L, Items).\nItems = [1, 2.5].\n\n?- new_object('java.util.ArrayList', [], L), L.add(x), L.add(y), list_items(L, Items).\nItems = [x, y].\n\n?- list_items(L, Items).\nthrows error(instantiation_error, _).\n```";
   }
+  protoOf(ListItems).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(ListItems).toIterable_j8vuup_k$ = function (_this__u8e3s4) {
     return toList(_this__u8e3s4);
   };
@@ -2322,7 +2387,7 @@
     return !(_this__u8e3s4 == null) ? isInterface(_this__u8e3s4, KtList) : false;
   };
   protoOf(ListItems).get_items_cgxsjz_k$ = function (_this__u8e3s4) {
-    return asSequence_0(_this__u8e3s4);
+    return asSequence(_this__u8e3s4);
   };
   protoOf(ListItems).get_items_ay3mtl_k$ = function (_this__u8e3s4) {
     return this.get_items_cgxsjz_k$(isInterface(_this__u8e3s4, KtList) ? _this__u8e3s4 : THROW_CCE());
@@ -2336,7 +2401,11 @@
   function NewObject3() {
     NewObject3_instance = this;
     Functional.call(this, 'new_object');
+    this.help_1 = "`new_object(+Type, +Arguments, -ObjectRef)`\n\nInstantiates `Type` by calling its public constructor that best matches the list `Arguments`, and unifies `ObjectRef` with a reference to the new object. `Type` may be an atom holding a fully qualified type name (e.g. `'java.util.ArrayList'`), a type reference, or a `$Alias` reference to a type (e.g. `$arraylist`). Arguments are converted to objects as in `invoke_method/3`; use `as` casts to disambiguate overloaded constructors. Fails if the type name cannot be resolved. Raises a type error if `Type` is not callable or `Arguments` is not a list, an existence error if no constructor accepts the arguments, and a system error if the constructor throws.\n\n**Examples**\n\n```prolog\n?- new_object('java.util.ArrayList', [], L), L.add(a), N := L.size.\nN = 1.\n\n?- new_object($arraylist, [], L), list_items(L, Items).\nItems = [].\n\n?- new_object('no.such.Type', [], L).\nno.\n\n?- new_object('java.util.ArrayList', [a], L).\nthrows error(representation_error(_), _).\n\n?- new_object('java.util.ArrayList', [a, b, c], L).\nthrows error(existence_error(oop_constructor, _), _).\n```";
   }
+  protoOf(NewObject3).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(NewObject3).computeOneSubstitution_omzw8j_k$ = function (_this__u8e3s4, first, second, third) {
     Companion_getInstance_7().ensuringArgumentIsStruct_lk4yyp_k$(_this__u8e3s4, 0);
     Companion_getInstance_7().ensuringArgumentIsList_n20mbc_k$(_this__u8e3s4, 1);
@@ -2363,11 +2432,16 @@
           var e = $p;
           throw e.toLogicError_fiiu4e_k$(_this__u8e3s4.context, _this__u8e3s4.signature);
         } else {
-          if ($p instanceof Error) {
+          if ($p instanceof ResolutionException) {
             var e_0 = $p;
-            throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_0);
+            throw e_0;
           } else {
-            throw $p;
+            if ($p instanceof Error) {
+              var e_1 = $p;
+              throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_1);
+            } else {
+              throw $p;
+            }
           }
         }
       }
@@ -2386,7 +2460,11 @@
   function NullRef_0() {
     NullRef_instance = this;
     TypeTester.call(this, 'null_ref');
+    this.help_1 = "`null_ref(@Term)`\n\nSucceeds if `Term` is the null reference, i.e. the term representing a JVM/Kotlin `null` value (as returned, for instance, by a method returning `null`). Fails otherwise, including when `Term` is unbound.\n\n**Examples**\n\n```prolog\n?- new_object('java.util.HashMap', [], M), invoke_method(M, get(k), V), null_ref(V).\nyes.\n\n?- null_ref(foo).\nno.\n\n?- null_ref(X).\nno.\n```";
   }
+  protoOf(NullRef_0).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(NullRef_0).testType_81tyi7_k$ = function (term) {
     return isInterface(term, NullRef);
   };
@@ -2399,7 +2477,11 @@
   function ObjectRef_0() {
     ObjectRef_instance = this;
     TypeTester.call(this, 'object_ref');
+    this.help_1 = "`object_ref(@Term)`\n\nSucceeds if `Term` is an object reference, i.e. a term wrapping a JVM/Kotlin object (rendered like `<object:java.util.ArrayList#123>`), as produced by `new_object/3`, `cast/3`, `invoke_strict/3` and friends. The null reference counts as an object reference. Fails otherwise, including when `Term` is unbound.\n\n**Examples**\n\n```prolog\n?- new_object('java.util.ArrayList', [], L), object_ref(L).\nyes.\n\n?- type('java.lang.String', T), object_ref(T).\nno.\n\n?- object_ref(X).\nno.\n```";
   }
+  protoOf(ObjectRef_0).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(ObjectRef_0).testType_81tyi7_k$ = function (term) {
     return isInterface(term, ObjectRef);
   };
@@ -2575,7 +2657,11 @@
   function Ref_0() {
     Ref_instance = this;
     TypeTester.call(this, 'ref');
+    this.help_1 = "`ref(@Term)`\n\nSucceeds if `Term` is a reference of any kind: either an object reference (see `object_ref/1`, including the null reference) or a type reference (see `type_ref/1`). Fails otherwise, including when `Term` is unbound. References are opaque atomic terms that can be passed around, unified, and used as receivers of method calls.\n\n**Examples**\n\n```prolog\n?- type('java.lang.String', T), ref(T).\nyes.\n\n?- new_object('java.util.ArrayList', [], L), ref(L).\nyes.\n\n?- ref(hello).\nno.\n```";
   }
+  protoOf(Ref_0).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(Ref_0).testType_81tyi7_k$ = function (term) {
     return isInterface(term, Ref);
   };
@@ -2596,7 +2682,11 @@
   function Register() {
     Register_instance = this;
     NonBacktrackable.call(this, 'register');
+    this.help_1 = "`register(+Ref, +Alias)`\n\nRegisters the object or type reference `Ref` under the ground term `Alias`, by adding an `alias(Alias, Ref)` fact to the static knowledge base. Afterwards `$Alias` can be used wherever a reference is expected, e.g. as the receiver of a method call. Registering an already-used alias adds another fact, so the earliest registration keeps taking precedence until removed with `unregister/1`. Raises an instantiation error if an argument is unbound or `Alias` is not ground, and a type error if `Ref` is not a reference or `Alias` is not callable.\n\n**Examples**\n\n```prolog\n?- new_object('java.util.ArrayList', [], L), register(L, my_list).\nyes.\n\n?- $my_list.add(a), N := $my_list.size.\nN = 1.\n\n?- register(X, my_alias).\nthrows error(instantiation_error, _).\n```";
   }
+  protoOf(Register).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(Register).computeOne_sdv9lb_k$ = function (_this__u8e3s4, first_0, second) {
     Companion_getInstance_7().ensuringAllArgumentsAreInstantiated_60kzw2_k$(_this__u8e3s4);
     ensuringArgumentIsRef(_this__u8e3s4, 0);
@@ -2618,7 +2708,11 @@
   function SetItems() {
     SetItems_instance = this;
     AbstractIterableItems.call(this, 'set', getKClass(KtSet));
+    this.help_1 = '`set_items(?SetRef, ?Items)`\n\nConverts between a Prolog list `Items` and an object reference `SetRef` wrapping a JVM/Kotlin `Set` with the same elements (duplicates are dropped, insertion order is kept). If `Items` is a list, each item is converted to an object (respecting `as` casts and `$Alias` references) and `SetRef` is unified with a reference to a fresh set; otherwise, if `SetRef` references a `Set`, `Items` is unified with its elements converted back to terms: strings become atoms, numbers become Prolog numbers, and other objects stay object references. Deterministic. Raises an instantiation error if both arguments are unbound, and a type error if `SetRef` is neither unbound nor an object reference; fails if it references something that is not a `Set`.\n\n**Examples**\n\n```prolog\n?- set_items(S, [a, b, b]), set_items(S, L).\nL = [a, b].\n\n?- set_items(S, [1, 1, 2.5]), set_items(S, L).\nL = [1, 2.5].\n\n?- set_items(S, [a, b]), N := S.size.\nN = 2.\n\n?- list_items(L, [a]), set_items(L, Items).\nno.\n```';
   }
+  protoOf(SetItems).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(SetItems).toIterable_j8vuup_k$ = function (_this__u8e3s4) {
     return toSet(_this__u8e3s4);
   };
@@ -2626,7 +2720,7 @@
     return !(_this__u8e3s4 == null) ? isInterface(_this__u8e3s4, KtSet) : false;
   };
   protoOf(SetItems).get_items_ma8yx5_k$ = function (_this__u8e3s4) {
-    return asSequence_0(_this__u8e3s4);
+    return asSequence(_this__u8e3s4);
   };
   protoOf(SetItems).get_items_ay3mtl_k$ = function (_this__u8e3s4) {
     return this.get_items_ma8yx5_k$(isInterface(_this__u8e3s4, KtSet) ? _this__u8e3s4 : THROW_CCE());
@@ -2640,8 +2734,12 @@
   function Type() {
     Type_instance = this;
     Functional_0.call(this, 'type');
+    this.help_1 = "`type(?TypeName, ?TypeRef)`\n\nConverts between an atom `TypeName` and a type reference `TypeRef` to the class it names. Given an atom holding a fully qualified type name (e.g. `'java.lang.String'`), unifies `TypeRef` with a reference to that class, failing if no such class exists; given a type reference, unifies `TypeName` with the name of its class. Deterministic. Raises an instantiation error if both arguments are unbound and a type error if the bound argument has the wrong shape.\n\n**Examples**\n\n```prolog\n?- type('java.util.ArrayList', T), new_object(T, [], L), N := L.size.\nN = 0.\n\n?- type('java.util.ArrayList', T), type(Name, T).\nName = 'ArrayList'.\n\n?- type('no.such.Type', T).\nno.\n\n?- type(Name, 'java.lang.String').\nthrows error(type_error(type_reference, 'java.lang.String'), _).\n```";
     this.typeFactory_1 = Companion_getInstance_14().default_1;
   }
+  protoOf(Type).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(Type).computeOneSubstitution_uplwem_k$ = function (_this__u8e3s4, first, second) {
     var tmp$ret$0;
     $l$block: {
@@ -2691,11 +2789,16 @@
           var e = $p;
           throw e.toLogicError_fiiu4e_k$(_this__u8e3s4.context, _this__u8e3s4.signature);
         } else {
-          if ($p instanceof Error) {
+          if ($p instanceof ResolutionException) {
             var e_0 = $p;
-            throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_0);
+            throw e_0;
           } else {
-            throw $p;
+            if ($p instanceof Error) {
+              var e_1 = $p;
+              throw Companion_instance_4.forUncaughtKtException(_this__u8e3s4.context, e_1);
+            } else {
+              throw $p;
+            }
           }
         }
       }
@@ -2714,7 +2817,11 @@
   function TypeRef_0() {
     TypeRef_instance = this;
     TypeTester.call(this, 'type_ref');
+    this.help_1 = "`type_ref(@Term)`\n\nSucceeds if `Term` is a type reference, i.e. a term wrapping a JVM/Kotlin class (rendered like `<type:java.lang.String>`), as produced by `type/2` or by `$Alias` references to types such as `$string`. Type references can be used to instantiate a class (`new_object/3`) or to invoke its static members. Fails otherwise, including when `Term` is unbound.\n\n**Examples**\n\n```prolog\n?- alias(string, T), type_ref(T).\nyes.\n\n?- type_ref('java.lang.String').\nno.\n\n?- new_object('java.util.ArrayList', [], L), type_ref(L).\nno.\n```";
   }
+  protoOf(TypeRef_0).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(TypeRef_0).testType_81tyi7_k$ = function (term) {
     return isInterface(term, TypeRef);
   };
@@ -2738,7 +2845,11 @@
   function Unregister() {
     Unregister_instance = this;
     NonBacktrackable_0.call(this, 'unregister');
+    this.help_1 = "`unregister(+Alias)`\n\nRemoves every `alias(Alias, _)` fact for the ground term `Alias` from the static knowledge base, undoing `register/2` (it can also remove the library's default aliases, such as `string` or `stdout`). Fails if no such alias is registered. Raises a type error if `Alias` is unbound or not callable, and an instantiation error if it is not ground.\n\n**Examples**\n\n```prolog\n?- new_object('java.util.ArrayList', [], L), register(L, my_list).\nyes.\n\n?- unregister(my_list).\nyes.\n\n?- alias(my_list, R).\nno.\n\n?- unregister(my_list).\nno.\n```";
   }
+  protoOf(Unregister).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(Unregister).computeOne_6dkmes_k$ = function (_this__u8e3s4, first_0) {
     Companion_getInstance_7().ensuringArgumentIsStruct_lk4yyp_k$(_this__u8e3s4, 0);
     if (!first_0.get_isGround_twq4nu_k$()) {
@@ -2781,12 +2892,16 @@
     RuleWrapper_init_$Init$('alias', 2, VOID, this);
     this.alias_1 = alias;
     this.ref_1 = ref;
+    this.help_1 = "`alias(?Alias, ?Ref)`\n\nAssociates a ground term `Alias` with an object or type reference `Ref`, so that `$Alias` can stand for `Ref` wherever a reference is expected (as a method receiver, as a constructor or method argument, or as the type in `as` casts and `cast/3`). The library ships facts for common types (`string`, `array`, `list`, `arraylist`, `map`, `hashmap`, `int`, `integer`, `double`, `float`, `long`, `short`, `byte`, `char`, `bool`, `boolean`, `any`, `nothing`, `big_integer`, `big_decimal`) and, on the JVM, `system` and `math` (types) plus `stdout`, `stderr` and `stdin` (objects). Querying it enumerates the registered aliases on backtracking; add or remove aliases with `register/2` and `unregister/1`.\n\n**Examples**\n\n```prolog\n?- alias(A, _).\nA = string ; A = array ; A = list.\n\n?- alias(string, T), type(Name, T).\nName = 'String'.\n\n?- alias(nope, R).\nno.\n```";
     // Inline function 'kotlin.require' call
     if (!this.alias_1.get_isGround_twq4nu_k$()) {
       var message = 'Alias must be a ground term, got: ' + this.alias_1.toString();
       throw IllegalArgumentException_init_$Create$(toString_0(message));
     }
   }
+  protoOf(Alias).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(Alias).get_head_btpmqe_k$ = function (_this__u8e3s4) {
     return toList(sequenceOf_0([this.alias_1, this.ref_1]));
   };
@@ -2809,22 +2924,22 @@
   function ColonEquals$Cast$_get_R_$ref_879xch() {
     return constructCallableReference(function (p0) {
       return _get_R__7mlo3j(p0);
-    }, 1, 0, 138);
+    }, 1, 0, 132);
   }
   function ColonEquals$Cast$_get_X_$ref_5d06zb() {
     return constructCallableReference(function (p0) {
       return _get_X__7mlo8p(p0);
-    }, 1, 0, 139);
+    }, 1, 0, 133);
   }
   function ColonEquals$Cast$_get_Y_$ref_4vykl4() {
     return constructCallableReference(function (p0) {
       return _get_Y__7mlo9k(p0);
-    }, 1, 0, 140);
+    }, 1, 0, 134);
   }
   function ColonEquals$Cast$_get_T_$ref_796ok3() {
     return constructCallableReference(function (p0) {
       return _get_T__7mlo59(p0);
-    }, 1, 0, 141);
+    }, 1, 0, 135);
   }
   function _get_R__7mlo3j_0($this) {
     var tmp = KProperty1;
@@ -2837,12 +2952,12 @@
   function ColonEquals$Invocation$_get_R_$ref_tlu5kw() {
     return constructCallableReference(function (p0) {
       return _get_R__7mlo3j_0(p0);
-    }, 1, 0, 142);
+    }, 1, 0, 136);
   }
   function ColonEquals$Invocation$_get_M_$ref_vz29jv() {
     return constructCallableReference(function (p0) {
       return _get_M__7mlnz8(p0);
-    }, 1, 0, 143);
+    }, 1, 0, 137);
   }
   function _get_C__7mlnqm($this) {
     var tmp = KProperty1;
@@ -2863,22 +2978,22 @@
   function ColonEquals$Assignment$_get_C_$ref_kw9fvw() {
     return constructCallableReference(function (p0) {
       return _get_C__7mlnqm(p0);
-    }, 1, 0, 144);
+    }, 1, 0, 138);
   }
   function ColonEquals$Assignment$_get_P_$ref_r1uj0f() {
     return constructCallableReference(function (p0) {
       return _get_P__7mlo1t(p0);
-    }, 1, 0, 145);
+    }, 1, 0, 139);
   }
   function ColonEquals$Assignment$_get_R_$ref_rzxrst() {
     return constructCallableReference(function (p0) {
       return _get_R__7mlo3j_1(p0);
-    }, 1, 0, 146);
+    }, 1, 0, 140);
   }
   function ColonEquals$Assignment$_get_V_$ref_tw49dl() {
     return constructCallableReference(function (p0) {
       return _get_V__7mlo6z(p0);
-    }, 1, 0, 147);
+    }, 1, 0, 141);
   }
   function Cast_0() {
     Cast_instance_0 = this;
@@ -2952,7 +3067,11 @@
   }
   function ColonEquals() {
     RuleWrapper_init_$Init$(':=', 2, VOID, this);
+    this.help_1 = "`?Target := +Expression`\n\nFluent evaluation and assignment. If `Target` is unbound, `Target := Receiver.m1(...).m2` evaluates the method/property chain on the right (see `./2`) and binds `Target` to the converted result of the last access; a right-hand side that is not a chain is just unified with `Target` (e.g. `X := 5`). `Target := Term as Type` additionally converts the (evaluated) `Term` via `cast/3`, binding `Target` to an object reference; here `Type` must be a type reference or a `$Alias` such as `$long`, and since `as` binds tighter than `.`, a chain must be parenthesised: `R := (Obj.size) as $long`. If `Target` is bound, it must be a chain `Receiver.Property` (possibly longer), and `:=` evaluates everything but the last access and then assigns `Expression` to `Property` via `assign/3`.\n\n**Examples**\n\n```prolog\n?- new_object('java.util.ArrayList', [], L), L.add(a), N := L.size.\nN = 1.\n\n?- X := 5.\nX = 5.\n\n?- new_object('java.util.ArrayList', [], L), R := (L.size) as $long, object_ref(R).\nyes.\n\n?- new_object('java.awt.Point', [1, 2], P), P.x := 7, X := P.x.\nX = 7.\n```";
   }
+  protoOf(ColonEquals).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   function _get_Method__a3idyi($this) {
     var tmp = KProperty1;
     return $this.Method$delegate_1.getValue($this, getPropertyCallableRef('Method', 1, tmp, Dot$_get_Method_$ref_b7a4zw(), null));
@@ -2964,19 +3083,23 @@
   function Dot$_get_Method_$ref_b7a4zw() {
     return constructCallableReference(function (p0) {
       return _get_Method__a3idyi(p0);
-    }, 1, 0, 148);
+    }, 1, 0, 142);
   }
   function Dot$_get_Ref_$ref_33uzaq() {
     return constructCallableReference(function (p0) {
       return _get_Ref__e5vi4e(p0);
-    }, 1, 0, 149);
+    }, 1, 0, 143);
   }
   function Dot() {
     Dot_instance = this;
     RuleWrapper_init_$Init$('.', 2, VOID, this);
+    this.help_1 = "`+Receiver.+Message`\n\nFluent member access: invokes `Message` on the object, type, or `$Alias` referenced by `Receiver`, discarding the result. `Message` is an atom (a no-argument method, or a property to read) or a compound `name(Arg1, ..., ArgN)`; arguments are converted to objects, with `as` casts to steer overload selection. Since `.` is right-associative, accesses can be chained: `Obj.foo(1).bar` calls `foo(1)` on `Obj`, then `bar` on its result, each step via `invoke_method/3`. Used as a goal, it runs the chain for its side effects; to capture the final result write `Result := Obj.foo(1).bar` (see `:=/2`). Errors are those of `invoke_method/3`.\n\n**Examples**\n\n```prolog\n?- $stdout.println(hello).\n% prints: hello\nyes.\n\n?- new_object('java.util.ArrayList', [], L), L.add(a), L.add(b), list_items(L, Items).\nItems = [a, b].\n\n?- new_object('java.util.ArrayList', [], L), L.nope.\nthrows error(existence_error(_, _), _).\n```";
     this.Method$delegate_1 = this.variables_1;
     this.Ref$delegate_1 = this.variables_1;
   }
+  protoOf(Dot).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(Dot).get_head_btpmqe_k$ = function (_this__u8e3s4) {
     return listOf([_get_Ref__e5vi4e(this), _get_Method__a3idyi(this)]);
   };
@@ -3008,22 +3131,22 @@
   function FluentReduce$Recursive$_get_P_$ref_qmyw78() {
     return constructCallableReference(function (p0) {
       return _get_P__7mlo1t_0(p0);
-    }, 1, 0, 150);
+    }, 1, 0, 144);
   }
   function FluentReduce$Recursive$_get_M_$ref_s23rdt() {
     return constructCallableReference(function (p0) {
       return _get_M__7mlnz8_0(p0);
-    }, 1, 0, 151);
+    }, 1, 0, 145);
   }
   function FluentReduce$Recursive$_get_P1_$ref_ksmyi5() {
     return constructCallableReference(function (p0) {
       return _get_P1__ndbjd6(p0);
-    }, 1, 0, 152);
+    }, 1, 0, 146);
   }
   function FluentReduce$Recursive$_get_X_$ref_mulx1o() {
     return constructCallableReference(function (p0) {
       return _get_X__7mlo8p_0(p0);
-    }, 1, 0, 153);
+    }, 1, 0, 147);
   }
   function _get_P__7mlo1t_1($this) {
     var tmp = KProperty1;
@@ -3036,12 +3159,12 @@
   function FluentReduce$Couple$_get_P_$ref_o7vzn6() {
     return constructCallableReference(function (p0) {
       return _get_P__7mlo1t_1(p0);
-    }, 1, 0, 154);
+    }, 1, 0, 148);
   }
   function FluentReduce$Couple$_get_M_$ref_pn0utr() {
     return constructCallableReference(function (p0) {
       return _get_M__7mlnz8_1(p0);
-    }, 1, 0, 155);
+    }, 1, 0, 149);
   }
   function Companion_8() {
     this.FUNCTOR_1 = 'fluent_reduce';
@@ -3111,12 +3234,16 @@
   function FluentReduce$_get_R_$ref_ypb4y4() {
     return constructCallableReference(function (p0) {
       return p0.get_R_1mhr55_k$();
-    }, 1, 0, 156);
+    }, 1, 0, 150);
   }
   function FluentReduce() {
     RuleWrapper_init_$Init$('fluent_reduce', 2, VOID, this);
+    this.help_1 = "`fluent_reduce(+Expression, ?Result)`\n\nHelper behind `./2` and `:=/2`: evaluates a chain of member accesses `Receiver.M1.M2...` (which, as `.` is the list constructor, is the same term as the improper list `[Receiver, M1 | M2]`) by invoking `M1` on `Receiver` via `invoke_method/3`, then `M2` on that result, and so on, unifying `Result` with the last result. A term that is not a chain is unified with `Result` unchanged. Deterministic (each clause cuts). Errors are those of `invoke_method/3`.\n\n**Examples**\n\n```prolog\n?- fluent_reduce($math.max(1, 2), M).\nM = 2.\n\n?- new_object('java.lang.StringBuilder', [abc], B), fluent_reduce(B.reverse.toString, S).\nS = cba.\n\n?- fluent_reduce(foo, R).\nR = foo.\n```";
     this.R$delegate_1 = this.variables_1;
   }
+  protoOf(FluentReduce).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(FluentReduce).get_R_1mhr55_k$ = function () {
     var tmp = KProperty1;
     return this.R$delegate_1.getValue(this, getPropertyCallableRef('R', 1, tmp, FluentReduce$_get_R_$ref_ypb4y4(), null));
@@ -3135,21 +3262,25 @@
   function NewObject2$_get_Type_$ref_gxw6of() {
     return constructCallableReference(function (p0) {
       return _get_Type__cwwv8x(p0);
-    }, 1, 0, 157);
+    }, 1, 0, 151);
   }
   function NewObject2$_get_Instance_$ref_jt2xca() {
     return constructCallableReference(function (p0) {
       return _get_Instance__cwfjuy(p0);
-    }, 1, 0, 158);
+    }, 1, 0, 152);
   }
   function NewObject2() {
     NewObject2_instance = this;
     // Inline function 'it.unibo.tuprolog.solve.AbstractWrapper.functor' call
     var tmp$ret$0 = NewObject3_getInstance().signature.name;
     RuleWrapper_init_$Init$(tmp$ret$0, 2, VOID, this);
+    this.help_1 = "`new_object(+Type, -ObjectRef)`\n\nInstantiates `Type` through its public no-argument constructor and unifies `ObjectRef` with a reference to the new object; shorthand for `new_object(Type, [], ObjectRef)`. `Type` may be an atom holding a fully qualified type name, a type reference, or a `$Alias` reference to a type. Errors are those of `new_object/3`.\n\n**Examples**\n\n```prolog\n?- new_object('java.util.ArrayList', L), N := L.size.\nN = 0.\n\n?- new_object($hashmap, M), M.put(k, v), V := M.get(k).\nV = v.\n\n?- new_object('java.lang.Integer', I).\nthrows error(existence_error(_, _), _).\n```";
     this.Type$delegate_1 = this.variables_1;
     this.Instance$delegate_1 = this.variables_1;
   }
+  protoOf(NewObject2).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(NewObject2).get_head_btpmqe_k$ = function (_this__u8e3s4) {
     return listOf([_get_Type__cwwv8x(this), _get_Instance__cwfjuy(this)]);
   };
@@ -3183,22 +3314,22 @@
   function PropertyReduce$Recursive$_get_B1_$ref_kiryiu() {
     return constructCallableReference(function (p0) {
       return _get_B1__ndb8zg(p0);
-    }, 1, 0, 159);
+    }, 1, 0, 153);
   }
   function PropertyReduce$Recursive$_get_C_$ref_epsz1a() {
     return constructCallableReference(function (p0) {
       return _get_C__7mlnqm_0(p0);
-    }, 1, 0, 160);
+    }, 1, 0, 154);
   }
   function PropertyReduce$Recursive$_get_O_$ref_919iay() {
     return constructCallableReference(function (p0) {
       return _get_O__7mlo0y(p0);
-    }, 1, 0, 161);
+    }, 1, 0, 155);
   }
   function PropertyReduce$Recursive$_get_P_$ref_8k7vwr() {
     return constructCallableReference(function (p0) {
       return _get_P__7mlo1t_2(p0);
-    }, 1, 0, 162);
+    }, 1, 0, 156);
   }
   function Companion_9() {
     this.FUNCTOR_1 = 'property_reduce';
@@ -3247,18 +3378,22 @@
   function PropertyReduce$_get_A_$ref_14cvqu() {
     return constructCallableReference(function (p0) {
       return p0.get_A_1mhr4o_k$();
-    }, 1, 0, 163);
+    }, 1, 0, 157);
   }
   function PropertyReduce$_get_B_$ref_1lei51() {
     return constructCallableReference(function (p0) {
       return p0.get_B_1mhr4p_k$();
-    }, 1, 0, 164);
+    }, 1, 0, 158);
   }
   function PropertyReduce() {
     RuleWrapper_init_$Init$('property_reduce', 3, VOID, this);
+    this.help_1 = "`property_reduce(+Expression, ?Ref, ?Property)`\n\nHelper behind the assignment form of `:=/2`: given a chain of member accesses `Receiver.M1....Mn.Property`, evaluates every access but the last one (as `fluent_reduce/2` does, via `invoke_method/3`), unifying `Ref` with the reference reached that way and `Property` with the final access. Deterministic (each clause cuts); fails if `Expression` is not a chain.\n\n**Examples**\n\n```prolog\n?- new_object('java.lang.StringBuilder', [abc], B), property_reduce(B.reverse.length, R, P), S := R.toString.\nP = length, S = cba.\n\n?- property_reduce(foo, R, P).\nno.\n```";
     this.A$delegate_1 = this.variables_1;
     this.B$delegate_1 = this.variables_1;
   }
+  protoOf(PropertyReduce).get_help_won7nu_k$ = function () {
+    return this.help_1;
+  };
   protoOf(PropertyReduce).get_A_1mhr4o_k$ = function () {
     var tmp = KProperty1;
     return this.A$delegate_1.getValue(this, getPropertyCallableRef('A', 1, tmp, PropertyReduce$_get_A_$ref_14cvqu(), null));