]> matita.cs.unibo.it Git - helm.git/log
helm.git
16 years agoBIG FAT WARNING: DEVELOPMENTS DIE HERE
Enrico Tassi [Thu, 10 Jan 2008 22:32:03 +0000 (22:32 +0000)]
BIG FAT WARNING: DEVELOPMENTS DIE HERE
What follows is the email on the helm mailing list

Riassunto:

 - non esistono più i developments

 - non esiste più il comando set "baseuri" "cic:/...." (non serve più)

 - questa mail è parecchio lunga, ma le prossime 2 sezioni le consiglio
   a _tutti_, quelle successive solo a chi aveva molti development
   dipendenti luno dall'altro. Ad ogni modo, il manuale di matita (che
   si apre con F1) è stato aggiornato e al posto dei developments ora
   spiega come funziona ora la compilazione.

Dove sono scritte le baseuri?

 - nella radice dei vostri ma (per esempio library/, tests/,
   contribs/RELATIOANL etc...) c'è un file di testo chiamato 'root'.

 - ad esempio il file library/root contiene una riga tipo:

       baseuri = cic:/matita

 - la baseuri in cui i files .ma vengono compilati si calcola guardando
   il path tra la radice e il file. As esempio

       library/nat/plus.ma

   essendo "radicato" da library/root che definisce la baseuri a
   cic:/matita verrà compilato in

       cic:/matita + /nat/plus/

   (esattamente dove era compilato prima, e tutti i .ma committati,
   quando necessario, sono stati porati a questo schema. In tutta
   library solo 1 file non lo rispettava).

Come si compila adesso che non c'è più matitamake?

 - da matita non cambia nulla, ho solo tolto un paio di popup che
   chiedevano sempre conferme di cose inutili (tipo se compilare il file
   incluso o no... ora lo compila sempre).

 - matitac ha cambiato leggermente semantica, ma potete fregarvene: la
   seguente linea continua a funzionare e fa le stesse cose di prima.

     cd library; make opt

 - il file delle dipendenze tra i files .ma prima veniva generato a ogni
   make con matitadep, ora non viene più fatto, quindi se cambiare gli
   includes che fate in un file fate un make depend.opt (o make depend
   se avete compilato in bytecode).

   matitadep è sempre stato lento, per questo motivo non viene chiamato
   tutte le volte. stamattina ho risolto un vecchissimo problema
   (ricordate che ogni tanto andava in stack overflow?) e ora mi sembra
   anche molto più veloce, quindi forse lo si potrebbe lanciare sempre
   ... vedremo

Qui finisce la parte necessaria a tutti, ci si sente coraggioso continui
pure. In generale il codice ML è diventato più semplice, matita è anche
più veloce a compilare e spero che i vari BUG dei developments siano
spariti. Chiaramente ce ne saranno di nuovi... ma spero di meno.

Dettagli del root file (dipendenze tra radici)

  - il root file è una lista associative chiave -> valore le cui linee
    matchano la seguente regexp:

      \s*[^=]+\s*=\s*.+\s*

    le chiavi utilizzabili sono: baseuri, include_paths.

  - per esempio, tests/ ha bisogno di legacy/ e vari files in tests/
    hanno la riga: include "coq.ma". Il root file per tests è:

        baseuri=cic:/tests
        include_paths=../legacy

  - library/ sta sempre negli include paths, se usate files in library
    non è necessario dichiarare il relativo include path

  - si possono dichiarare più include_paths, separandoli da spazi. per
    sempio

        include_paths=../foo ../../bar/baz

  - i files che includete devono esistere in uno degli include paths,
    e vengono cercati:

       - in / (path assoluto, da evitare possibilmente)
       - in .
       - in library/
       - negli include_paths

  - una volta scritto il root file, lanciando matitadep viene generato
    un file depends. Tale processo da anche degli errori, in caso alcuni
    files non riescano ad essere trovati nei paths specificati

  - una volta fatto ciò matita lanciato da dentro una radice compila
    tutto, quindi se serve "salta" in una delle radici specificate
    dagli include_paths e compila pure li dentro

  - non sono supportati (e non so nemmeno cosa voglia dire) files con lo
    stesso nome (e path relativo alla radice) in radici differenti,
    in tal caso include "a.ma" se a.ma esiste anche in una delle radici
    da cui si dipende, include sempre quello locale (prima c'era un bug
    per cui includeva quello non-locale). ho dovuto fare un po di
    renaming nei files di ferruccio, da capire se vanno bene.

Dove è finito make:

  - matitac ora legge il file depends e compila lui i files nell'orine
    giusto (e solo se necessario).

      ./matitac          compila tutto (nella radice della dir corrente)
      ./matitac foo/a.ma compila a.ma (e le sue dipendenze se necessario)

  - matitadep ha bisogno di un file root, detto ciò si cerca i files con
    estensione .ma e ne genera un depends, con formato:

      a b c
      b d
      d
      c

    le lettere sono nomi di files (quindi .ma, niente .moo, .mo,
    .mo.opt etc...). Le linee si leggono come

      a deve essere compilato dopo b e c
      b dopo d
      d e c anche subito

   i files esterni alla radice (trovati via include paths) vengono
   listati anche loro, senza dipendenze (tanto salta nella loro radice e
   fa "make" li dentro, dove le sue dipendenze sono note).

Mi sembra più veloce a compilare?!

 - prima, per ogni file .ma, veniva lanciato matitac, ora è lo stesso
   matitac a compilare tutti i files uno dopo l'altro. Il tempo speso a
   creare un processo (e per matita ce ne vuole parecchio) è
   risparmiato, quindi per un set di files molto piccoli si vede anche
   ad occhio la differenza.

 - il fatto che non venga generato un nuovo processo ha fatto si che
   tutti i bug relativi all'undo (parti imperative dello stato)
   venissero a galla. Ne è rimasto solo uno, che non so risolvere:
   quando camlp5 stampa "<W> una regola è stata mascherata" che li pare
   che tutto si inceppi.

 - il nostro environment è imperativo e nessuno lo svuota mai,
   risultato: non carica gli oggetti da disco quasi mai... è sia un bene
   che un male... potrei resettarlo alla fine di ogni comilazione...

 - Non ho mai provato a fare .ma con dipendenze circolari, magari diverge.

16 years agoimplementation of the make algorithm, still unfinished.
Enrico Tassi [Thu, 3 Jan 2008 10:13:04 +0000 (10:13 +0000)]
implementation of the make algorithm, still unfinished.
to be integrated with matitac to drop our beloved developments.

16 years ago* use findlib to pass -I flags down to ocamldoc, instead of relying on
Stefano Zacchiroli [Sat, 29 Dec 2007 20:05:54 +0000 (20:05 +0000)]
* use findlib to pass -I flags down to ocamldoc, instead of relying on
  hard-coded paths

16 years ago* bump standards-version, no changes needed
Stefano Zacchiroli [Sat, 29 Dec 2007 20:03:19 +0000 (20:03 +0000)]
* bump standards-version, no changes needed

16 years ago* convert the package to a non-native Debian package
Stefano Zacchiroli [Sat, 29 Dec 2007 20:02:29 +0000 (20:02 +0000)]
* convert the package to a non-native Debian package

16 years ago* debian/rules: instead of passing explicit -I flags to ocamldoc, do them
Stefano Zacchiroli [Fri, 28 Dec 2007 14:46:26 +0000 (14:46 +0000)]
* debian/rules: instead of passing explicit -I flags to ocamldoc, do them
  via ocamlfind and OCAML_OCAMLDOC_OCAMLFIND_FLAGS

16 years agooverwrite old symlink upon dist
Stefano Zacchiroli [Fri, 28 Dec 2007 14:44:09 +0000 (14:44 +0000)]
overwrite old symlink upon dist

16 years agoignore tons of generated stuff
Stefano Zacchiroli [Fri, 28 Dec 2007 14:22:55 +0000 (14:22 +0000)]
ignore tons of generated stuff

16 years ago* convert package to a non-native one (closes: #457353)
Stefano Zacchiroli [Fri, 28 Dec 2007 14:19:30 +0000 (14:19 +0000)]
* convert package to a non-native one (closes: #457353)

16 years ago* promote Vcs-* fields to real debian/control fields
Stefano Zacchiroli [Fri, 28 Dec 2007 14:12:38 +0000 (14:12 +0000)]
* promote Vcs-* fields to real debian/control fields
* update standards-version, no changes needed

16 years agobeginning proof of chebyshev's bound on prim.
Wilmer Ricciotti [Fri, 21 Dec 2007 16:09:59 +0000 (16:09 +0000)]
beginning proof of chebyshev's bound on prim.

16 years agoaccepts the poly shape for gviz maps
Enrico Tassi [Wed, 19 Dec 2007 15:10:19 +0000 (15:10 +0000)]
accepts the poly shape for gviz maps

16 years agoupper bound for logarithmic summation
Wilmer Ricciotti [Mon, 17 Dec 2007 21:31:35 +0000 (21:31 +0000)]
upper bound for logarithmic summation

16 years agoA few more lemmas.
Andrea Asperti [Mon, 17 Dec 2007 12:07:27 +0000 (12:07 +0000)]
A few more lemmas.

16 years agoMuch more verbose statistics.
Claudio Sacerdoti Coen [Sun, 16 Dec 2007 15:12:10 +0000 (15:12 +0000)]
Much more verbose statistics.

16 years agoBug fixed: \n prevented recognition.
Claudio Sacerdoti Coen [Sun, 16 Dec 2007 14:19:01 +0000 (14:19 +0000)]
Bug fixed: \n prevented recognition.

16 years agoSome inequalities.
Andrea Asperti [Thu, 13 Dec 2007 15:29:58 +0000 (15:29 +0000)]
Some inequalities.

16 years agoProgress.
Wilmer Ricciotti [Wed, 12 Dec 2007 18:26:29 +0000 (18:26 +0000)]
Progress.

16 years agoadd support for adding identifiers instead of only changing them (enabled per default)
Stefano Zacchiroli [Wed, 12 Dec 2007 18:13:14 +0000 (18:13 +0000)]
add support for adding identifiers instead of only changing them (enabled per default)

16 years agoPartial progress.
Andrea Asperti [Tue, 11 Dec 2007 15:26:48 +0000 (15:26 +0000)]
Partial progress.

16 years agomore chosmetic
Enrico Tassi [Mon, 10 Dec 2007 14:49:59 +0000 (14:49 +0000)]
more chosmetic

16 years agoMain result for e.
Andrea Asperti [Mon, 10 Dec 2007 14:24:40 +0000 (14:24 +0000)]
Main result for e.

16 years agosandeich lemma makeup
Enrico Tassi [Mon, 10 Dec 2007 11:39:38 +0000 (11:39 +0000)]
sandeich lemma makeup

16 years agoRestructuring.
Andrea Asperti [Mon, 10 Dec 2007 10:11:13 +0000 (10:11 +0000)]
Restructuring.

16 years agoMain inequalities for e.
Andrea Asperti [Mon, 10 Dec 2007 08:43:07 +0000 (08:43 +0000)]
Main inequalities for e.

16 years agoAdded summation formula for the power of a binomial.
Wilmer Ricciotti [Sun, 9 Dec 2007 23:28:01 +0000 (23:28 +0000)]
Added summation formula for the power of a binomial.

16 years agothe is_structure is a bad idea if you don't have canonical structures.
Enrico Tassi [Sat, 8 Dec 2007 10:36:00 +0000 (10:36 +0000)]
the is_structure is a bad idea if you don't have canonical structures.

16 years agoBinomial coefficients and costant e.
Andrea Asperti [Fri, 7 Dec 2007 11:41:49 +0000 (11:41 +0000)]
Binomial coefficients and costant e.

16 years agoA few more theorems.
Andrea Asperti [Fri, 7 Dec 2007 11:38:57 +0000 (11:38 +0000)]
A few more theorems.

16 years agodump spurious errors max
Stefano Zacchiroli [Thu, 6 Dec 2007 15:29:52 +0000 (15:29 +0000)]
dump spurious errors max

16 years agoexcede->excess
Enrico Tassi [Thu, 6 Dec 2007 11:17:39 +0000 (11:17 +0000)]
excede->excess

16 years agoexcedence -> excess
Enrico Tassi [Thu, 6 Dec 2007 10:16:17 +0000 (10:16 +0000)]
excedence -> excess

16 years agoweight -> value
Enrico Tassi [Thu, 6 Dec 2007 09:57:03 +0000 (09:57 +0000)]
weight -> value

16 years agodump result table in \TeX format
Stefano Zacchiroli [Wed, 5 Dec 2007 15:26:53 +0000 (15:26 +0000)]
dump result table in \TeX format

16 years ago...
Claudio Sacerdoti Coen [Wed, 5 Dec 2007 13:47:20 +0000 (13:47 +0000)]
...

16 years agoRepeated errors are not duplicated.
Claudio Sacerdoti Coen [Tue, 4 Dec 2007 22:08:45 +0000 (22:08 +0000)]
Repeated errors are not duplicated.

16 years agoEven if the error is not localized, it was not a good idea to make the unification...
Claudio Sacerdoti Coen [Tue, 4 Dec 2007 22:01:38 +0000 (22:01 +0000)]
Even if the error is not localized, it was not a good idea to make the unification error
escape.

16 years agorefactoring of some lemmas, shorter proofs
Enrico Tassi [Tue, 4 Dec 2007 18:40:03 +0000 (18:40 +0000)]
refactoring of some lemmas, shorter proofs

16 years agoSome terms are not localized from the very beginning :-(
Claudio Sacerdoti Coen [Tue, 4 Dec 2007 17:51:09 +0000 (17:51 +0000)]
Some terms are not localized from the very beginning :-(

16 years agoAdded debugging option to ask for all disambiguation errors (even spurious ones)...
Claudio Sacerdoti Coen [Tue, 4 Dec 2007 17:17:04 +0000 (17:17 +0000)]
Added debugging option to ask for all disambiguation errors (even spurious ones) in all passes.

16 years agoOne more error localized. But the code is really ugly here :-(
Claudio Sacerdoti Coen [Tue, 4 Dec 2007 15:56:03 +0000 (15:56 +0000)]
One more error localized. But the code is really ugly here :-(

16 years agoadded do_heavy_checks documentation
Enrico Tassi [Tue, 4 Dec 2007 15:17:01 +0000 (15:17 +0000)]
added do_heavy_checks documentation

16 years agodo_heavy_checks not always true, take ths option from the registry instead
Enrico Tassi [Tue, 4 Dec 2007 15:16:25 +0000 (15:16 +0000)]
do_heavy_checks not always true, take ths option from the registry instead

16 years agoadded do_heavy_checks default
Enrico Tassi [Tue, 4 Dec 2007 15:15:47 +0000 (15:15 +0000)]
added do_heavy_checks default

16 years agoif parameter type is given, this assert is false
Enrico Tassi [Tue, 4 Dec 2007 15:13:43 +0000 (15:13 +0000)]
if parameter type is given, this assert is false

16 years agoOnly errors from passes 4 and 6 are kept.
Claudio Sacerdoti Coen [Tue, 4 Dec 2007 14:12:14 +0000 (14:12 +0000)]
Only errors from passes 4 and 6 are kept.

16 years agoReindented.
Claudio Sacerdoti Coen [Tue, 4 Dec 2007 11:02:16 +0000 (11:02 +0000)]
Reindented.

16 years agosandwitch theorem done
Enrico Tassi [Tue, 4 Dec 2007 09:55:44 +0000 (09:55 +0000)]
sandwitch theorem done

16 years agoremoved all the axioms!!!
Enrico Tassi [Tue, 4 Dec 2007 00:05:46 +0000 (00:05 +0000)]
removed all the axioms!!!

16 years agosligtly more general results, still to reorganize
Enrico Tassi [Tue, 4 Dec 2007 00:01:44 +0000 (00:01 +0000)]
sligtly more general results, still to reorganize

16 years agook
Enrico Tassi [Mon, 3 Dec 2007 23:44:35 +0000 (23:44 +0000)]
ok

16 years ago1 lemma left!!!!
Enrico Tassi [Mon, 3 Dec 2007 15:21:39 +0000 (15:21 +0000)]
1 lemma left!!!!

16 years agoSome progress.
Andrea Asperti [Mon, 3 Dec 2007 11:39:09 +0000 (11:39 +0000)]
Some progress.

16 years agoForward compatibility with new lablgtk2.
Claudio Sacerdoti Coen [Sun, 2 Dec 2007 15:07:05 +0000 (15:07 +0000)]
Forward compatibility with new lablgtk2.

16 years agocarabinieri almost done
Enrico Tassi [Sat, 1 Dec 2007 12:46:08 +0000 (12:46 +0000)]
carabinieri almost done

16 years agocarabinieri almost done
Enrico Tassi [Fri, 30 Nov 2007 17:57:32 +0000 (17:57 +0000)]
carabinieri almost done

16 years agocleanup of the eq_trans burdain
Enrico Tassi [Fri, 30 Nov 2007 14:35:21 +0000 (14:35 +0000)]
cleanup of the eq_trans burdain

16 years ago3.11 !!!
Enrico Tassi [Fri, 30 Nov 2007 12:40:56 +0000 (12:40 +0000)]
3.11 !!!

16 years agoadded a way to generate all the utf8 symbols
Enrico Tassi [Fri, 30 Nov 2007 09:07:40 +0000 (09:07 +0000)]
added a way to generate all the utf8 symbols

16 years agoDead code removed.
Claudio Sacerdoti Coen [Wed, 28 Nov 2007 22:29:16 +0000 (22:29 +0000)]
Dead code removed.

16 years agoBug fixed: an unification exception used to escape during eat_prods.
Claudio Sacerdoti Coen [Wed, 28 Nov 2007 21:08:18 +0000 (21:08 +0000)]
Bug fixed: an unification exception used to escape during eat_prods.

16 years agomore stuff
Enrico Tassi [Wed, 28 Nov 2007 18:12:33 +0000 (18:12 +0000)]
more stuff

16 years ago...
Enrico Tassi [Wed, 28 Nov 2007 17:00:44 +0000 (17:00 +0000)]
...

16 years agoOutput is now in UTF8 character counts.
Claudio Sacerdoti Coen [Tue, 27 Nov 2007 17:44:11 +0000 (17:44 +0000)]
Output is now in UTF8 character counts.

16 years agoOptions declared but not parsed.
Claudio Sacerdoti Coen [Tue, 27 Nov 2007 17:14:52 +0000 (17:14 +0000)]
Options declared but not parsed.

16 years agoPorted to camlp5 < 5.00
Claudio Sacerdoti Coen [Tue, 27 Nov 2007 17:07:08 +0000 (17:07 +0000)]
Ported to camlp5 < 5.00

16 years agoBack-ported to camlp5 < 5.00.
Claudio Sacerdoti Coen [Tue, 27 Nov 2007 16:56:54 +0000 (16:56 +0000)]
Back-ported to camlp5 < 5.00.

16 years ago....
Enrico Tassi [Tue, 27 Nov 2007 16:44:49 +0000 (16:44 +0000)]
....

16 years ago...
Enrico Tassi [Tue, 27 Nov 2007 16:44:11 +0000 (16:44 +0000)]
...

16 years agoremove debug fake data
Stefano Zacchiroli [Tue, 27 Nov 2007 16:23:21 +0000 (16:23 +0000)]
remove debug fake data

16 years ago(hackish) scripts for testing spurious disambiguation error criteria
Stefano Zacchiroli [Tue, 27 Nov 2007 16:22:45 +0000 (16:22 +0000)]
(hackish) scripts for testing spurious disambiguation error criteria

16 years agoadd "-order" cmdline option to just print a possible build order of the given *.ma...
Stefano Zacchiroli [Tue, 27 Nov 2007 15:15:20 +0000 (15:15 +0000)]
add "-order" cmdline option to just print a possible build order of the given *.ma files and then quit

16 years agochange naming scheme for rottened script, so that they do not mess up matitadep/make...
Stefano Zacchiroli [Tue, 27 Nov 2007 15:13:38 +0000 (15:13 +0000)]
change naming scheme for rottened script, so that they do not mess up matitadep/make assumptions

16 years ago...
Enrico Tassi [Tue, 27 Nov 2007 12:33:14 +0000 (12:33 +0000)]
...

16 years agomajor reorganization (read cleanup)
Enrico Tassi [Tue, 27 Nov 2007 11:56:08 +0000 (11:56 +0000)]
major reorganization (read cleanup)

16 years agobir georganization, most of the structures done
Enrico Tassi [Tue, 27 Nov 2007 11:36:52 +0000 (11:36 +0000)]
bir georganization, most of the structures done

16 years agoavoid rottening of constructor names in pattern matchings
Stefano Zacchiroli [Tue, 27 Nov 2007 11:19:14 +0000 (11:19 +0000)]
avoid rottening of constructor names in pattern matchings

16 years agoignore sqlite db and rottener* executables
Stefano Zacchiroli [Tue, 27 Nov 2007 09:28:59 +0000 (09:28 +0000)]
ignore sqlite db and rottener* executables

16 years ago- use "O" as the rottening token
Stefano Zacchiroli [Tue, 27 Nov 2007 09:27:01 +0000 (09:27 +0000)]
- use "O" as the rottening token
- add generation of a trailer with error location information

16 years agomake target for cleaning rottened files
Stefano Zacchiroli [Tue, 27 Nov 2007 09:26:34 +0000 (09:26 +0000)]
make target for cleaning rottened files

16 years agoreorganization of many files according to the new basic picture.
Enrico Tassi [Mon, 26 Nov 2007 16:54:32 +0000 (16:54 +0000)]
reorganization of many files according to the new basic picture.
todo: premetric lattice and the various coercions

16 years agofirst draft of a script to mechanically introduce (disambiguation) errors into Matita...
Stefano Zacchiroli [Mon, 26 Nov 2007 16:23:50 +0000 (16:23 +0000)]
first draft of a script to mechanically introduce (disambiguation) errors into Matita scripts

16 years agoignore *.o
Stefano Zacchiroli [Mon, 26 Nov 2007 15:31:10 +0000 (15:31 +0000)]
ignore *.o

16 years agoadd dump of position information in the lexed file
Stefano Zacchiroli [Mon, 26 Nov 2007 15:30:52 +0000 (15:30 +0000)]
add dump of position information in the lexed file

16 years agoAxiom moved from ex_deriv to deriv where it belongs to.
Claudio Sacerdoti Coen [Mon, 26 Nov 2007 12:43:17 +0000 (12:43 +0000)]
Axiom moved from ex_deriv to deriv where it belongs to.

16 years agoNotation improved.
Claudio Sacerdoti Coen [Mon, 26 Nov 2007 12:42:51 +0000 (12:42 +0000)]
Notation improved.

16 years agoSome code clean-up.
Claudio Sacerdoti Coen [Mon, 26 Nov 2007 12:06:29 +0000 (12:06 +0000)]
Some code clean-up.

16 years agoDisambiguation error compaction is now performed in the same way by matita and
Claudio Sacerdoti Coen [Mon, 26 Nov 2007 11:54:52 +0000 (11:54 +0000)]
Disambiguation error compaction is now performed in the same way by matita and
matitac. The difference is that matitac shows every error in every pass,
marking spurious errors as spurious.

16 years agofor csc
Enrico Tassi [Mon, 26 Nov 2007 10:55:46 +0000 (10:55 +0000)]
for csc

16 years agopretty
Enrico Tassi [Mon, 26 Nov 2007 10:52:53 +0000 (10:52 +0000)]
pretty

16 years agoPatch to automatically generate filename.error.md5.ma scripts every time a
Claudio Sacerdoti Coen [Mon, 26 Nov 2007 10:22:36 +0000 (10:22 +0000)]
Patch to automatically generate filename.error.md5.ma scripts every time a
disambiguation error is faced by the user.

16 years agoAlmost there.
Andrea Asperti [Mon, 26 Nov 2007 08:45:42 +0000 (08:45 +0000)]
Almost there.

16 years agoThis version of disambiguate.ml implements yet another (better?) criterio for
Claudio Sacerdoti Coen [Sun, 25 Nov 2007 11:13:48 +0000 (11:13 +0000)]
This version of disambiguate.ml implements yet another (better?) criterio for
spurious error detection. An error is spurious iff:

a) it is obtained interpreting a symbol s using an interpretation \phi
b) there exists another interpretation \phi' such that
   1) dom(\phi') = dom(\phi)
   2) \phi' is valid

It should be true that no nested error locations should occur.
In principle this also suggests the possibility of changing the user interface
to show all alternative errors at the same time.

16 years agoBug fixed: an unification exception used to escape when coercions were disabled.
Claudio Sacerdoti Coen [Sun, 25 Nov 2007 10:44:38 +0000 (10:44 +0000)]
Bug fixed: an unification exception used to escape when coercions were disabled.

16 years agosince the previous commit fixed some bugs when the context has a deleted hp,
Enrico Tassi [Fri, 23 Nov 2007 18:15:10 +0000 (18:15 +0000)]
since the previous commit fixed some bugs when the context has a deleted hp,
the script is better

16 years agorestored the right context used to generate names. see the comment
Enrico Tassi [Fri, 23 Nov 2007 17:59:19 +0000 (17:59 +0000)]
restored the right context used to generate names. see the comment

16 years agoThis alternative version of disambiguate.crit2 implements the following
Claudio Sacerdoti Coen [Fri, 23 Nov 2007 15:59:43 +0000 (15:59 +0000)]
This alternative version of disambiguate.crit2 implements the following
criterion for spurious error detection:

an error is spurious iff:
  a) it is obtained interpreting the symbol s with the interpretation \phi
  b) there exists another interpretation \phi' such that
     1) dom(\phi) = dom(\phi')
     2) \phi' is valid
     3) \phi(x)=\phi'(x) for each x != s

More (but not too many) errors are spurious according to this criterion.

16 years agofast and sound registry lists
Enrico Tassi [Fri, 23 Nov 2007 15:26:03 +0000 (15:26 +0000)]
fast and sound registry lists
faster matitamake setup

16 years ago* NOT RELEASED YET
Stefano Zacchiroli [Fri, 23 Nov 2007 13:25:21 +0000 (13:25 +0000)]
* NOT RELEASED YET

16 years ago* bump deps on lablgtk2 to match lates upstream
Stefano Zacchiroli [Fri, 23 Nov 2007 13:00:08 +0000 (13:00 +0000)]
* bump deps on lablgtk2 to match lates upstream
* debian/control
  - fix VCS field names (now supported natively by dpkg)
  - add Homepage field