Skip to content

A simple implementation of Hoare logic in Agda, closely following the original paper

Notifications You must be signed in to change notification settings

mzeuner/SimpleHoareProver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 

Repository files navigation

A simple implementation of Hoare logic in Agda

This is a very ad-hoc implementation of a Hoare triple prover, following C.A.R. Hoare's classic paper "An Axiomatic Basis for Computer Programming". Its original purpose is to serve as a demo ina reading course on "Classical Papers in Computer Science". The original example from the paper can be found in Example.agda

The code type checks with Agda v2.6.3 and version 1.7.2 of Agda's standard library.

About

A simple implementation of Hoare logic in Agda, closely following the original paper

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages