Typed path polymorphism
From MaRDI portal
Publication:2424892
Recommendations
Cites work
- scientific article; zbMATH DE number 2185708 (Why is no real title available?)
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- scientific article; zbMATH DE number 1183236 (Why is no real title available?)
- scientific article; zbMATH DE number 919844 (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
- Functional and Logic Programming
- Fundamental properties of infinite trees
- Lambda calculus with patterns
- Pattern Calculus
- Programming Languages and Systems
- Semantics of typed lambda-calculus with constructors
- Subtyping recursion and parametric polymorphism in kernel Fun
- The rewriting calculus. II
- Type soundness for path polymorphism
- Typed Lambda Calculi and Applications
- Typed path polymorphism
- Types and programing languages
- Variations on the Common Subexpression Problem
Cited in
(5)
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)