Pure pattern calculus à la de Bruijn
From MaRDI portal
Publication:2229151
Cites work
- scientific article; zbMATH DE number 2185721 (Why is no real title available?)
- scientific article; zbMATH DE number 3961577 (Why is no real title available?)
- scientific article; zbMATH DE number 3659007 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Efficient type checking for path polymorphism
- First-class patterns
- Higher-order rewrite systems and their confluence
- Lambda calculus with patterns
- Normalisation for dynamic pattern calculi
- On abstract normalisation beyond neededness
- Pattern Calculus
- Pattern matching as cut elimination
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Programming Languages and Systems
- Pure pattern calculus à la de Bruijn
- Type soundness for path polymorphism
- Typed path polymorphism
- de Bruijn Indices for Metaterms
This page was built for publication: Pure pattern calculus à la de Bruijn
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229151)