First-class patterns

DOI10.1017/S0956796808007144zbMath1163.68315OpenAlexW2166643856MaRDI QIDQ3616447

Delia Kesner, C. Barry Jay

Publication date: 25 March 2009

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796808007144

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Functional programming and lambda calculus (68N18)

Related Items (14)

Self-quotation in a typed, intensional lambda-calculus ⋮ A combinatory account of internal structure ⋮ The Negligible and Yet Subtle Cost of Pattern Matching ⋮ Unnamed Item ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Typed path polymorphism ⋮ Unnamed Item ⋮ Pure pattern calculus à la de Bruijn ⋮ Intensional computation with higher-order functions ⋮ Programs as data structures in \(\lambda\)SF-calculus ⋮ Type soundness for path polymorphism ⋮ Conflicting accounts of \(\lambda\)-definability ⋮ On abstract normalisation beyond neededness ⋮ Unnamed Item

Uses Software

• Isabelle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lambda calculus with patterns
• Pure patterns type systems
• Pattern Calculus
• Term Rewriting and All That

This page was built for publication: First-class patterns