The following pages link to (Q4457464):
Displaying 11 items.
- Repairing time-determinism in the process algebra for hybrid systems (Q442292) (← links)
- A certified, corecursive implementation of exact real numbers (Q817858) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- \textsc{Prawf}: an interactive proof system for program extraction (Q2106598) (← links)
- The role of entropy in guiding a connection prover (Q2142077) (← links)
- Reasoning about iteration and recursion uniformly based on big-step semantics (Q2154025) (← links)
- Mathematical knowledge representation: semantic models and formalisms (Q2263116) (← links)
- Reasoning about object-based calculi in (co)inductive type theory and the theory of contexts (Q2642466) (← links)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
- Equality Checking for General Type Theories in Andromeda 2 (Q5041060) (← links)
- Bidirectional grammars for machine-code decoding and encoding (Q5915877) (← links)
