Applies f to x and returns the result.

f must be the ID of an object in the object store of the form E_Function f' (and thus f' of ML type data -> data).

x is serialized and transferred to the Isabelle process, the value f' x is computed, serialized and transferred back.

By definition of the type Isabelle.Data, x can be a tree containing integers, strings, and object IDs. When transferring an object ID to the Isabelle process, it is replaced by the object (exception) that is referred by the ID. And similarly, objects (exceptions) in the return value are added to the object store and replaced by IDs upon transfer to the Scala side.

This behavior gives rise to two simple use patterns:

Retrieving values: Say tree is some algebraic data type on the ML side, Tree is a corresponding Scala class, encode : tree -> data is a function that encodes a tree as data (using the DList, DInt, and DString constructors only), and E_Tree of tree is an exception type to store trees in the object store. Then we can define a function for retrieving a tree from the object store to Scala as follows:

val encodeID : Future[ID] = isabelle.storeValue("fn DObject (E_Tree tree) => encode tree")
def decode(data: Data) : Tree = ??? // The opposite of the ML function encode
def retrieve(id: ID) : Tree = {
  // Apply encode to the element referenced by id, result is an encoding of the tree as Data
  val dataFuture : Future[Data] = isabelle.applyFunction(encodeID, DObject(id))
  // For simplicitly, we force synchronous execution
  val data : Data = Await.result(dataFuture, Duration.Inf)
  decode(data)
}

Storing values: Continuing the above example, say decode : data -> tree is an ML function that decodes trees (inverse of encode above). Then we can store trees in the object store from Scala using the following function store:

val decodeID : Future[ID] = isabelle.storeValue("fn data => DObject (E_Tree (decode data))")
def encode(tree: Tree) : Data = ??? // The opposite of the ML function decode
def store(tree: Tree) : ID = {
  // Apply ML-decode to the Scala-encoded tree, store it in the object store, and return the ID (inside a Data)
  val dataFuture : Future[Data] = isabelle.applyFunction(decodeID, encode(tree))
  // For simplicitly, we force synchronous execution
  val data : Data = Await.result(dataFuture, Duration.Inf)
  // get the ID inside the returned data (referring to the tree object in the object store)
  val DObject(id) = data
  id
}

Of course, arbitrary combinations of these two ideas are possible. For example, one could have a Scala data structure that contains IDs of objects still on the ML side. These data structures can be serialized and deserialized similar to the above example, using the fact that the type Isabelle.Data allows IDs to occur anywhere in the tree.

Objects added to the object store by this mechanism are garbage collected on the ML side when the corresponding IDs are not used any more on the Scala side.

This approach is very low level. In particular, there is no type system support to ensure that the IDs contained in the serialized data actually refer to objects of the right type. A higher level typesafe approach for accessing data in the object store is given by de.unruh.isabelle.mlvalue.MLValue (see there). However, MLValues internally use the mechanism described here to transfer data to/from the Isabelle process. Thus, to add support for MLValues of new types, the applyFunction needs to be used.

Blocks until this future value is computed. (Or throws an exception if the computation fails.)

Throws an IsabelleDestroyedException if this Isabelle process has been destroyed. Otherwise does nothing.

Kills the running Isabelle process. After this, no more operations on values in the object store are possible. Futures corresponding to already running computations will throw an IsabelleDestroyedException.

Executes the ML code ml in the Isabelle process.

WARNING: This has a global side effect on the current Isabelle process because it modifies the ML name space.

Definitions made in ml affect the ML name space. (This name space is shared by all invocations of executeMLCode and storeValue.) This is intended mostly for defining new types. To create values (e.g., if ml is the code of a function that should be executed), preferably use storeValue which creates anonymous values in the object store. The ML code is executed in a context where the structure Control_Isabelle is not opened (i.e., you have to write Control_Isabelle.E_Int instead of E_Int).

Example: executeMLCode("exception E_Term of term") would declare an exception to store terms. (Not actually needed because this specific exception is predeclared.)

Waits till the computation of this value (in the Isabelle process) has finished. (Or until an exception is thrown.)

A future containing this object with the computation completed. In particular, if this value throws an exception upon computation, the future holds that exception.

Roughly the same as Future { this.force }.

Returns a future that completes when the computation of this object is complete. (Or that holds an exception if that computation throws an exception.) However, upon successful completion, the future may return an arbitrary (and thus useless) value. May be faster to implement than forceFuture because there may be already a future available but that returns the wrong value.

A utility method that returns "" if this value was successfully computed, " (computing)" if it still computes, and " (failed)" if it finished with an exception.

This can be useful to constructing human readable messages about this value.

Executes the ML expression ml in the Isabelle process.

The expression must be of ML type exn. The result of evaluating the expression is added to the object store. The ML code is executed in a context where the structure Control_Isabelle is opened (i.e., you can write E_Int instead of Control_Isabelle.E_Int).

In code that is supposed to support multiple instances of Isabelle, it can be cumbersome to keep track in which instances a given ML code fragment was already executed. See OperationCollection for a helper class to facilitate that.