Typed path polymorphism
From MaRDI portal
Publication:2424892
DOI10.1016/j.tcs.2019.02.018zbMath1423.68089OpenAlexW2920715361MaRDI QIDQ2424892
Andrés Viso, Mauricio Ayala-Rincón, Juan Edi, Eduardo Bonelli
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
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lambda calculus with patterns
- Fundamental properties of infinite trees
- Type soundness for path polymorphism
- Subtyping recursion and parametric polymorphism in kernel Fun
- Efficient and flexible matching of recursive types
- Typed path polymorphism
- The rewriting calculus - part II
- Semantics of Typed Lambda-Calculus with Constructors
- First-class patterns
- Pattern Calculus
- Variations on the Common Subexpression Problem
- Efficient recursive subtyping
- An extension of system F with subtyping
- Functional and Logic Programming
- Computer Science Logic
- Typed Lambda Calculi and Applications
- Programming Languages and Systems
This page was built for publication: Typed path polymorphism