1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.PL2017
Compiling Purely Functional Structured Programs
Phil Scott, Steven Obua, Jacques Fleuriot
We present a marriage of functional and structured imperative programming that embeds in pure lambda calculus. We describe how we implement the core of this language in a monadic D…
cs.LO2017★ 1 cited
Bootstrapping LCF Declarative Proofs
Phil Scott, Steven Obua, Jacques Fleuriot
Suppose we have been sold on the idea that formalised proofs in an LCF system should resemble their written counterparts, and so consist of formulas that only provide signposts for…