August 12, 2008 conference-paper The Böhm–Jacopini Theorem Is False, Propositionally Lecture notes in computer science DOI: 10.1007/978-3-540-70594-9_11 OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 23 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access On Propositional Program Equivalence (Extended Abstract) 2025 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 0 citations Algebras for Deterministic Computation Are Inherently Incomplete 2025 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access 4 citations CF-GKAT: Efficient Validation of Control-Flow Transformations 2025 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access 3 citations A General Completeness Theorem for Skip-Free Star Algebras 2025 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 1 citations 4 results References 0