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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper we consider the problem of certified static checking ofmodule-like constructs of programming languages. We argue that there arealgorithms and properties related to modules that can be defined and proven inan abstract way. We advocate the design of a generic Coq library, which isaimed to provide three building blocks for each checking mechanism:propositional, computable, and correctness proofs. Implemented part of thelibrary is justified by applying it to a certified static checker of anextension of STLC.

Generic Approach to Certified Static Checking of Module-like Constructs