The following pages link to Wojciech Moczydłowski (Q408533):
Displayed 11 items.
- Unifying sets and programs via dependent types (Q408534) (← links)
- Extracting the resolution algorithm from a completeness proof for the propositional calculus (Q636273) (← links)
- (Q3188047) (← links)
- Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics (Q3535610) (← links)
- Unifying Sets and Programs via Dependent Types (Q3605541) (← links)
- Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics (Q3613407) (← links)
- A Normalizing Intuitionistic Set Theory with Inaccessible Sets (Q5426072) (← links)
- Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus (Q5434504) (← links)
- Term Rewriting and Applications (Q5703860) (← links)
- Normalization of IZF with Replacement (Q5900206) (← links)
- Normalization of IZF with Replacement (Q5901479) (← links)