Pattern Calculus
From MaRDI portal
Recommendations
Cited in
(16)- Intensional computation with higher-order functions
- Programs as data structures in \(\lambda\)SF-calculus
- Type soundness for path polymorphism
- Self-quotation in a typed, intensional lambda-calculus
- Expressiveness of concurrent intensionality
- Pure pattern calculus à la de Bruijn
- Typed path polymorphism
- Continuation models for the lambda calculus with constructors
- On the expressiveness of symmetric communication
- First-class patterns
- Efficient type checking for path polymorphism
- Encoding the factorisation calculus
- Pattern-based calculi with finitary matching
- Conflicting accounts of \(\lambda\)-definability
- Programming Languages and Systems
- On abstract normalisation beyond neededness
This page was built for publication: Pattern Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629217)