First-class patterns
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- Lambda calculus with patterns
- Pattern Calculus
- Pure patterns type systems
- Term Rewriting and All That
- The lambda calculus. Its syntax and semantics. Rev. ed.
Cited in
(21)- Confluence of Pattern-Based Calculi
- On abstract normalisation beyond neededness
- Bimonadic Semantics for Basic Pattern Matching Calculi
- Intensional computation with higher-order functions
- Programs as data structures in \(\lambda\)SF-calculus
- The Negligible and Yet Subtle Cost of Pattern Matching
- Type soundness for path polymorphism
- Efficient type checking for path polymorphism
- Self-quotation in a typed, intensional lambda-calculus
- Normalisation for dynamic pattern calculi
- Translation Correctness for First-Order Object-Oriented Pattern Matching
- Typed path polymorphism
- A combinatory account of internal structure
- Solvability = typability + inhabitation
- Pattern Calculus
- Programming Languages and Systems
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- scientific article; zbMATH DE number 3878328 (Why is no real title available?)
- Conflicting accounts of \(\lambda\)-definability
- scientific article; zbMATH DE number 7756108 (Why is no real title available?)
- Pure pattern calculus à la de Bruijn
This page was built for publication: First-class patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616447)