English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

While methods of code abstraction and reuse are widespread and wellresearched, methods of proof abstraction and reuse are still emerging. Weconsider the use of dependent types for this purpose, introducing a completelymechanical approach to proof composition. We show that common techniques forabstracting algorithms over data structures naturally translate to abstractionsover proofs. We first introduce a language composed of a series of smallerlanguage components tied together by standard techniques from Malcom (1990). Weproceed by giving proofs of type preservation for each language component andshow that the basic ideas used in composing the syntactic data structures canbe applied to their semantics as well.

Modular Type-Safety Proofs using Dependant Types