Typed path polymorphism
From MaRDI portal
Publication:2424892
DOI10.1016/J.TCS.2019.02.018zbMATH Open1423.68089OpenAlexW2920715361MaRDI QIDQ2424892FDOQ2424892
Authors: Mauricio Ayala-Rincón, Eduardo Bonelli, Juan Edi, Andrés Viso 
Publication date: 25 June 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.02.018
Recommendations
Cites Work
- Title not available (Why is that?)
- Variations on the Common Subexpression Problem
- Fundamental properties of infinite trees
- Types and programing languages
- Title not available (Why is that?)
- First-class patterns
- Pattern Calculus
- Typed Lambda Calculi and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming Languages and Systems
- An extension of system \(F\) with subtyping
- Lambda calculus with patterns
- The rewriting calculus. II
- Functional and Logic Programming
- Efficient recursive subtyping
- Type soundness for path polymorphism
- Subtyping recursion and parametric polymorphism in kernel Fun
- Efficient and flexible matching of recursive types
- Typed path polymorphism
- Semantics of typed lambda-calculus with constructors
- Efficient type checking for path polymorphism
- Computer Science Logic
Cited In (5)
Uses Software
This page was built for publication: Typed path polymorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2424892)
