Efficient type checking for path polymorphism

DOI10.4230/LIPICS.TYPES.2015.6zbMATH Open1433.68094arXiv1704.09026MaRDI QIDQ4580227FDOQ4580227

Eduardo Bonelli, Juan Edi, Andrés Viso

Publication date: 13 August 2018

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Variations on the Common Subexpression Problem
• Types and programing languages
• Title not available (Why is that?)
• First-class patterns
• Pattern Calculus
• Typed Lambda Calculi and Applications
• An extension of system \(F\) with subtyping
• Lambda calculus with patterns
• Efficient recursive subtyping
• Type soundness for path polymorphism
• Subtyping recursion and parametric polymorphism in kernel Fun
• Efficient and flexible matching of recursive types
• Title not available (Why is that?)
• Computer Science Logic

Cited In (4)

• Type soundness for path polymorphism
• Typed path polymorphism
• Title not available (Why is that?)
• Pure pattern calculus à la de Bruijn

Uses Software

• cap-typechecking
• GitHub

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)