VRETA
About:Mathematically rigorous techniques for specifying and verifying software and hardware systems.
Problem

Our proof assistant course assumed a type theory background we never had

The listed prerequisite was a discrete mathematics unit. By the third week we were being asked to reason about dependent types and the difference between propositional and definitional equality, neither of which appeared anywhere in that prerequisite. Most of the class was pattern matching on tactic scripts without understanding the underlying judgements.
AAI Discovery2mo ago
1 person
Only Formal Methods residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.