103 lines
2.7 KiB
Coq
103 lines
2.7 KiB
Coq
Set Warnings "-notation-overridden,-parsing".
|
|
From Stdlib Require Export String.
|
|
From LF Require Import Maps.
|
|
|
|
Parameter MISSING: Type.
|
|
|
|
Module Check.
|
|
|
|
Ltac check_type A B :=
|
|
match type of A with
|
|
| context[MISSING] => idtac "Missing:" A
|
|
| ?T => first [unify T B; idtac "Type: ok" | idtac "Type: wrong - should be (" B ")"]
|
|
end.
|
|
|
|
Ltac print_manual_grade A :=
|
|
match eval compute in A with
|
|
| Some (_ ?S ?C) =>
|
|
idtac "Score:" S;
|
|
match eval compute in C with
|
|
| ""%string => idtac "Comment: None"
|
|
| _ => idtac "Comment:" C
|
|
end
|
|
| None =>
|
|
idtac "Score: Ungraded";
|
|
idtac "Comment: None"
|
|
end.
|
|
|
|
End Check.
|
|
|
|
From LF Require Import Maps.
|
|
Import Check.
|
|
|
|
Goal True.
|
|
|
|
idtac "------------------- t_update_same --------------------".
|
|
idtac " ".
|
|
|
|
idtac "#> t_update_same".
|
|
idtac "Possible points: 2".
|
|
check_type @t_update_same (
|
|
(forall (A : Type) (m : total_map A) (x : string),
|
|
@eq (forall _ : string, A) (@t_update A m x (m x)) m)).
|
|
idtac "Assumptions:".
|
|
Abort.
|
|
Print Assumptions t_update_same.
|
|
Goal True.
|
|
idtac " ".
|
|
|
|
idtac "------------------- t_update_permute --------------------".
|
|
idtac " ".
|
|
|
|
idtac "#> t_update_permute".
|
|
idtac "Possible points: 3".
|
|
check_type @t_update_permute (
|
|
(forall (A : Type) (m : total_map A) (v1 v2 : A) (x1 x2 : string)
|
|
(_ : not (@eq string x2 x1)),
|
|
@eq (forall _ : string, A) (@t_update A (@t_update A m x2 v2) x1 v1)
|
|
(@t_update A (@t_update A m x1 v1) x2 v2))).
|
|
idtac "Assumptions:".
|
|
Abort.
|
|
Print Assumptions t_update_permute.
|
|
Goal True.
|
|
idtac " ".
|
|
|
|
idtac " ".
|
|
|
|
idtac "Max points - standard: 5".
|
|
idtac "Max points - advanced: 5".
|
|
idtac "".
|
|
idtac "Allowed Axioms:".
|
|
idtac "functional_extensionality".
|
|
idtac "FunctionalExtensionality.functional_extensionality_dep".
|
|
idtac "plus_le".
|
|
idtac "le_trans".
|
|
idtac "le_plus_l".
|
|
idtac "add_le_cases".
|
|
idtac "Sn_le_Sm__n_le_m".
|
|
idtac "O_le_n".
|
|
idtac "".
|
|
idtac "".
|
|
idtac "********** Summary **********".
|
|
idtac "".
|
|
idtac "Below is a summary of the automatically graded exercises that are incomplete.".
|
|
idtac "".
|
|
idtac "The output for each exercise can be any of the following:".
|
|
idtac " - 'Closed under the global context', if it is complete".
|
|
idtac " - 'MANUAL', if it is manually graded".
|
|
idtac " - A list of pending axioms, containing unproven assumptions. In this case".
|
|
idtac " the exercise is considered complete, if the axioms are all allowed.".
|
|
idtac "".
|
|
idtac "********** Standard **********".
|
|
idtac "---------- t_update_same ---------".
|
|
Print Assumptions t_update_same.
|
|
idtac "---------- t_update_permute ---------".
|
|
Print Assumptions t_update_permute.
|
|
idtac "".
|
|
idtac "********** Advanced **********".
|
|
Abort.
|
|
|
|
(* 2026-01-07 13:18 *)
|
|
|
|
(* 2026-01-07 13:18 *)
|