The following pages link to First-class patterns (Q3616447):
Displaying 15 items.
- Conflicting accounts of \(\lambda\)-definability (Q511925) (← links)
- On abstract normalisation beyond neededness (Q683744) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Intensional computation with higher-order functions (Q1733061) (← links)
- Programs as data structures in \(\lambda\)SF-calculus (Q1744389) (← links)
- Type soundness for path polymorphism (Q1744425) (← links)
- Self-quotation in a typed, intensional lambda-calculus (Q2130593) (← links)
- Pure pattern calculus à la de Bruijn (Q2229151) (← links)
- Typed path polymorphism (Q2424892) (← links)
- A combinatory account of internal structure (Q3173527) (← links)
- (Q3343409) (← links)
- Efficient type checking for path polymorphism (Q4580227) (← links)
- The Negligible and Yet Subtle Cost of Pattern Matching (Q5056004) (← links)
- (Q5856410) (← links)
- (Q6079229) (← links)