Typed path polymorphism

Ayala-Rincón, Maurício; Bonelli, Eduardo; Edi, Juan; Viso, Andrés

doi:10.1016/j.tcs.2019.02.018

Cited by 3 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, t 1 As commented before, the ultimate goal of our research is the implementation of a prototype for a typed functional programming language capturing path polymorphism. This development is based on the Calculus of Applicative Patterns (CAP) [ABEV19], for which a static type system has already been introduced, guaranteeing well-behaved operational semantics, together with its corresponding efficient type-checking algorithm. CAP is essentially the static fragment of PPC, where the abstraction is generalised into an alternative (i.e.…”

Section: Proofmentioning

confidence: 99%

Pure Pattern Calculus à la de Bruijn

Martín,

Ríos,

Viso

2020

Preprint

Self Cite

View full text Add to dashboard Cite

It is well-known in the field of programming languages that dealing with variable names and binders may lead to conflicts such as undesired captures when implementing interpreters or compilers. This situation has been overcome by resorting to de Bruijn indices for calculi where binders capture only one variable name, like the λ-calculus. The advantage of this approach relies on the fact that so-called α-equivalence becomes syntactical equality when working with indices. In recent years pattern calculi have gained considerable attention given their expressiveness. They turn out to be notoriously convenient to study the foundations of modern functional programming languages modeling features like pattern matching, path polymorphism, pattern polymorphism, etc. However, the literature falls short when it comes to dealing with α-conversion and binders capturing simultaneously several variable names. Such is the case of the Pure Pattern Calculus (PPC): a natural extension of λ-calculus that allows to abstract virtually any term. This paper extends de Bruijn's ideas to properly overcome the multi-binding problem by introducing a novel presentation of PPC with bidimensional indices, in an effort to implement a prototype for a typed functional programming language based on PPC that captures path polymorphism.

show abstract

Section: Proofmentioning

confidence: 99%