2000 character limit reached
Tutorial implementation of Hoare logic in Haskell (2101.11320v10)
Published 27 Jan 2021 in cs.PL and cs.LO
Abstract: Using the programming language Haskell, we introduce an implementation of propositional calculus, number theory, and a simple imperative language that can evaluate arithmetic and boolean expressions. Finally, we provide an implementation of Hoare's logic which will allow us to deduce facts about programs without the need for a full evaluation.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
