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

We prove that the pattern matching problem is undecidable in polymorphiclambda-calculi (as Girard's system F) and calculi supporting inductive types(as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. Moregenerally pattern matching is undecidable in all the calculi in which primitiverecursive functions can be fairly represented in a precised sense.

The Undecidability of Pattern Matching in Calculi where Primitive Recursive Functions are Representable