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

Type inference is an application domain that is a natural fit for logicprogramming (LP). LP systems natively support unification, which serves as abasic building block of typical type inference algorithms. In particular,polymorphic type inference in the Hindley--Milner type system (HM) can besuccinctly specified and executed in Prolog. In our previous work, we havedemonstrated that more advanced features of parametric polymorphism beyond HM,such as type-constructor polymorphism and kind polymorphism, can be similarlyspecified in Prolog. Here, we demonstrate a specification for records, which isone of the most widely supported compound data structures in real-worldprogramming languages, and discuss the advantages and limitations of Prolog asa specification language for type systems. Record types are specified asorder-irrelevant collections of named fields mapped to their correspondingtypes. In addition, an open-ended collection is used to support rowpolymorphism for record types to be extensible.

An Executable Specification of Typing Rules for Extensible Records based on Row Polymorphism