Efficient type checking for path polymorphism

DOI10.4230/LIPICS.TYPES.2015.6MaRDI QIDQ4580227zbMATH OpenFDO

Authors Juan Edi, Andrés Viso, Eduardo Bonelli

Publication date 13 August 2018

Full work available at URL https://arxiv.org/abs/1704.09026

zbMATH Keywords

pattern matching\(\lambda\)-calculustype checkingpath polymorphism

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Typed path polymorphism
• Type soundness for path polymorphism
• Basic polymorphic typechecking
• Publication:3484338
• Polymorphic regular tree types and patterns

Cites work

• scientific article; zbMATH DE number 5852776 (Why is no real title available?)
• scientific article; zbMATH DE number 1183236 (Why is no real title available?)
• An extension of system \(F\) with subtyping
• Computer Science Logic
• Efficient and flexible matching of recursive types
• Efficient recursive subtyping
• Efficient type checking for path polymorphism
• First-class patterns
• Lambda calculus with patterns
• Pattern Calculus
• Subtyping recursion and parametric polymorphism in kernel Fun
• Type soundness for path polymorphism
• Typed Lambda Calculi and Applications
• Types and programing languages
• Variations on the Common Subexpression Problem

Cited in

(4)

• Type soundness for path polymorphism
• Efficient type checking for path polymorphism
• Typed path polymorphism
• Pure pattern calculus à la de Bruijn

Describes a project that uses

Uses Software

• GitHub
• cap-typechecking

This page was built for publication: Efficient type checking for path polymorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580227)