gforge | a cli tool for generating code based on gendry | Generator Utils library

I am trying to formalize business rules in Isabelle/HOL, but business rules involve the change of the values of some variables, like if x=5 => x=6. => is not the usual implication there, because x is 5 in one world (interpretation, semantic domain) and after the execution of the rule the x is 6 and it is already a different world (different interpretation, assignment function, semantic domain). So - technically is x=5 => x=6 is not the formula in First Order Logic and it is not also the formula of Higher Order Logic of Isabelle/HOL. More possible is that it is the formula in dynamic/action logic [rule1](x=5)=(x=6) (that defines that upon application of rule1 to the formula in some world yields to the truthful formula in some other world (dynamic/action logic is essentially a kind of modal logic and Kripke/possible world semantics can be applied here).

Now, back to Isabelle/HOL or Coq: FOL/HOL theory is set of formulas in all the worlds or in one particular world. If we stay at FOL/HOL then there is no change of the world, no change of the values of the variables. We should go to the modal logics if we would like to model, reasong about such changes. But can it be done in HOL? This change of world?

http://matryoshka.gforge.inria.fr/pubs/fernandez_burgos_bsc_thesis.pdf is good work about formalization of sorting algorithms in Isabelle/HOL, functional programming is used there and there is no need of variables and hence - no this change among worlds. But if we try to model Reinforcement Learning, Markov processes, impertative/object oriented programming, business rules in Isabelle/HOL, then we should express this change. How to do that?

How to express business rule if x=5 => x=6 in Isabelle/HOL?

The same approach can be used in Coq, that is why answers from the Coq community are welcome as well.

There are many advantages to using Cairo to save R graphics (see here, for example). When saving PDFs, for instance, the cairo_pdf device correctly embeds custom fonts.

Using the cairo_pdf graphics device is easy with ggplot-based graphics with ggsave():

I have an XSD which is used to create the corresponding classes in Java interfaces. Every element of my xsd has its own , and I was wondering if I could reference another into a documentation tag.

To be clearer, if I was writing this in Java Doc:

I have about 300 JPA entities where the getters are annotated with persistence annotations. I would like to find a way to move all such annotations to the properties instead and remove all getters and setters. I did this manually for about 100 of these classes but it's very time consuming and mind numbing work.

I'm looking at source code transformation tools like Spoon but still not sure it can do what I need it to do.

More specifically, how can I transform this code:

SPro can be downloaded here,and it's installed by ./configure, make, make install. However, ./configure and make both arouse errors.

First, run ./configure, get the following warnings:

Try /large_dsk/share/upload/spro-5.0/spro-5.0/auxdir/missing --help' for more information
configure: WARNING: 'missing' script is too old or missing
checking for gawk... no

The total output is as following:

I am trying to implement with Autotools a “multiversion option” for my shared library: in case the user enables it, the library must be able to cohabitate with other versions of itself. That means that the name of the binary must contain the version string, or at least any string that distinguishes it from other versions.

libtool has an option, -release, which does exactly that. However, as explained here, this will not work for my purpose, because at least one file will not have any suffix appended and this will create conflicts with other versions of the package:

4.3. Multiple libraries versions

While libtool was designed to handle the presence of multiple libraries implementing the same API (and even ABI) on the system, distributions made that necessity moot. On the other hand, it is not uncommon for multiple versions of a library to be installed, with multiple API implemented, allowing consumers to pick their supported version. This is the case, for instance, of Gtk+ and Glib.

The first reaction would be to combine the two options, -release and -version-info; this would, though, be wrong. When using -release the static archive, the one with .a extension, the libtool archive (see Section 6, “Libtool Archives”) and the .so file used by the link editor would not have a revision appended, which means that two different version of the library can't be installed at the same time.

In this situation, the best option is to append part of the library's version information to the library's name, which is exemplified by Glib's libglib-2.0.so.0 soname. To do so, the declaration in the Makefile.am has to be like this:

...

I want to create a plot that has adjusted values (top line for each stratum) and matched values (line represented by X in each stratum) across all strata eg men, women, age <55, age >55 etc. For the matched values, I'd like to have a diamond/other shape or different colour to highlight. But not sure how to do?

I realise I could use this example http://gforge.se/2013/12/the-forestplot-of-dreams/ to make two separate datasets, one for adjusted values and one for matched values, and then combine - but would rather not have to input all values again.

Can someone please help edit the third section of my code to make a diff shape or diff colour for the matched values in my graph (matched vals are the lines represented by X in the N column).

I am trying to import the SPAMS toolbox for sparse representations in MATLAB, using SPAMS v2.6 (downloaded from http://spams-devel.gforge.inria.fr/downloads.html), MATLAB R2018a, and under Win10. I have already compiled MEX-files with MinGW64.

Errors occur when I ran compile.m, it seems that some of the functions/modules (I'm not sure what to call them) can be compiled while others cannot. I have tried to comment those functions caused errors (about half of the total functions), the rest ran well but they cannot pass the tests in SPAMS. I guess those functions were somehow interactive.

Via CpdtTactics.v:

[...] Succeed iff x is in the list ls, represented with left-associated nested tuples.

Ltac inList x ls := match ls with | x => idtac | (_, x) => idtac | (?LS, _) => inList x LS end.

This seems atypical. Doesn't the tail of the list conventionally go in the right-hand side of the tuple?