Tue, 22 Mar 2011 11:14:33 +0100 pretty_string: proper handling of negative max_len;
wenzelm [Tue, 22 Mar 2011 11:14:33 +0100] rev 42047
pretty_string: proper handling of negative max_len;
Mon, 21 Mar 2011 23:38:32 +0100 added Lexicon.encode_position, Lexicon.decode_position;
wenzelm [Mon, 21 Mar 2011 23:38:32 +0100] rev 42046
added Lexicon.encode_position, Lexicon.decode_position;
Mon, 21 Mar 2011 21:16:39 +0100 tuned;
wenzelm [Mon, 21 Mar 2011 21:16:39 +0100] rev 42045
tuned;
Mon, 21 Mar 2011 21:05:08 +0100 tuned;
wenzelm [Mon, 21 Mar 2011 21:05:08 +0100] rev 42044
tuned;
Mon, 21 Mar 2011 20:56:44 +0100 clarified Syn_Trans.parsetree_to_ast and Syn_Trans.ast_to_term;
wenzelm [Mon, 21 Mar 2011 20:56:44 +0100] rev 42043
clarified Syn_Trans.parsetree_to_ast and Syn_Trans.ast_to_term;
Mon, 21 Mar 2011 20:15:03 +0100 tuned;
wenzelm [Mon, 21 Mar 2011 20:15:03 +0100] rev 42042
tuned;
Mon, 21 Mar 2011 17:14:52 +0100 merged
wenzelm [Mon, 21 Mar 2011 17:14:52 +0100] rev 42041
merged
Mon, 21 Mar 2011 16:24:52 +0100 added judgement day configurations
krauss [Mon, 21 Mar 2011 16:24:52 +0100] rev 42040
added judgement day configurations
Mon, 21 Mar 2011 16:38:28 +0100 another attempt to exec ISABELLE_GHC robustly (cf. d8c3b26b3da4, 994d088fbfbc);
wenzelm [Mon, 21 Mar 2011 16:38:28 +0100] rev 42039
another attempt to exec ISABELLE_GHC robustly (cf. d8c3b26b3da4, 994d088fbfbc);
Mon, 21 Mar 2011 14:46:59 +0100 fixed perl error
krauss [Mon, 21 Mar 2011 14:46:59 +0100] rev 42038
fixed perl error
Mon, 21 Mar 2011 14:37:10 +0100 eliminated unnecessary generated ROOT.ML
krauss [Mon, 21 Mar 2011 14:37:10 +0100] rev 42037
eliminated unnecessary generated ROOT.ML
Mon, 21 Mar 2011 14:25:59 +0100 more precise dependencies
krauss [Mon, 21 Mar 2011 14:25:59 +0100] rev 42036
more precise dependencies
Mon, 21 Mar 2011 12:43:26 +0100 small test case for main mirabelle functionality, which easily breaks without noticing
krauss [Mon, 21 Mar 2011 12:43:26 +0100] rev 42035
small test case for main mirabelle functionality, which easily breaks without noticing
Mon, 21 Mar 2011 12:43:25 +0100 propagate mirabelle failures properly;
krauss [Mon, 21 Mar 2011 12:43:25 +0100] rev 42034
propagate mirabelle failures properly; flatten obscure return code semantics of Perl system command to 0/1
Mon, 21 Mar 2011 12:43:23 +0100 mirabelle: create modified theory file in original location, to ensure that its dependencies can be found (cf. aa8dce9ab8a9)
krauss [Mon, 21 Mar 2011 12:43:23 +0100] rev 42033
mirabelle: create modified theory file in original location, to ensure that its dependencies can be found (cf. aa8dce9ab8a9)
Mon, 21 Mar 2011 08:29:16 +0100 merged
bulwahn [Mon, 21 Mar 2011 08:29:16 +0100] rev 42032
merged
Fri, 18 Mar 2011 18:19:42 +0100 adapting predicate_compile_quickcheck; tuned
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42031
adapting predicate_compile_quickcheck; tuned
Fri, 18 Mar 2011 18:19:42 +0100 adapting mutabelle
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42030
adapting mutabelle
Fri, 18 Mar 2011 18:19:42 +0100 adapting SML_Quickcheck
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42029
adapting SML_Quickcheck
Fri, 18 Mar 2011 18:19:42 +0100 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42028
passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
Fri, 18 Mar 2011 18:19:42 +0100 extending the test data generators to take the evaluation terms as arguments
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42027
extending the test data generators to take the evaluation terms as arguments
Fri, 18 Mar 2011 18:19:42 +0100 adding option of evaluating terms after invocation in quickcheck
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42026
adding option of evaluating terms after invocation in quickcheck
Fri, 18 Mar 2011 18:19:42 +0100 adding eval option to quickcheck
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42025
adding eval option to quickcheck
Fri, 18 Mar 2011 18:19:42 +0100 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42024
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
Fri, 18 Mar 2011 18:19:42 +0100 adding minimalistic setup and transformation to handle functions as data to enable naive function generation for Quickcheck_Narrowing
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42023
adding minimalistic setup and transformation to handle functions as data to enable naive function generation for Quickcheck_Narrowing
Fri, 18 Mar 2011 18:19:42 +0100 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42022
adding a simple datatype for representing functions in Quickcheck_Narrowing
Fri, 18 Mar 2011 18:19:42 +0100 extending code_int type more; adding narrowing instance for type int; added test case for int instance
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42021
extending code_int type more; adding narrowing instance for type int; added test case for int instance
Fri, 18 Mar 2011 18:19:42 +0100 translating bash output in quickcheck_narrowing to handle special characters; adding simple test cases
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42020
translating bash output in quickcheck_narrowing to handle special characters; adding simple test cases
Fri, 18 Mar 2011 18:19:42 +0100 adding size as static argument in quickcheck_narrowing compilation
bulwahn [Fri, 18 Mar 2011 18:19:42 +0100] rev 42019
adding size as static argument in quickcheck_narrowing compilation
Sun, 20 Mar 2011 23:07:06 +0100 modernized specifications;
wenzelm [Sun, 20 Mar 2011 23:07:06 +0100] rev 42018
modernized specifications;
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip