The Negligible and Yet Subtle Cost of Pattern Matching

DOI10.1007/978-3-319-71237-6_21MaRDI QIDQ5056004zbMATH OpenOpenAlexFDO

Authors Beniamino Accattoli, Bruno Barras

Publication date 9 December 2022

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-71237-6_21

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Pattern matching with don't cares and few errors
• scientific article; zbMATH DE number 2119723
• Optimizing pattern matching
• Efficient pattern matching with scaling
• scientific article; zbMATH DE number 3949728
• Functional and Logic Programming
• scientific article; zbMATH DE number 7756108
• Approximating Approximate Pattern Matching

Cites work

• (Leftmost-outermost) beta reduction is invariant, indeed
• A compiled implementation of strong reduction
• A nonstandard standardization theorem
• A syntactic approach to type soundness
• An abstract factorization theorem for explicit substitutions
• Call-by-value solvability, revisited
• Computing with capsules
• Derivational complexity is an invariant cost model
• Deriving a lazy abstract machine
• Distilling abstract machines
• Explicit substitutions
• First-class patterns
• scientific article; zbMATH DE number 1953273 (Why is no real title available?)
• Implementing open call-by-value
• Lambda calculus with patterns
• Local bigraphs and confluence: two conjectures (extended abstract)
• Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation
• Modular, higher-order cardinality analysis in theory and practice
• New developments in environment machines
• On Constructor Rewrite Systems and the Lambda-Calculus
• On the Relative Usefulness of Fireballs
• On the value of variables
• Open call-by-value
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• The Negligible and Yet Subtle Cost of Pattern Matching
• The rewriting calculus. I
• The Theory of Calculi with Explicit Substitutions Revisited
• The useful MAM, a reasonable implementation of the strong -calculus
• Types and programing languages

Cited in

(7)

• scientific article; zbMATH DE number 4037164 (Why is no real title available?)
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• The Negligible and Yet Subtle Cost of Pattern Matching
• scientific article; zbMATH DE number 7756108 (Why is no real title available?)
• Reasonable space for the -calculus, logarithmically
• Mirroring call-by-need, or values acting silly
• Mirroring call-by-need, or values acting silly

Describes a project that uses

Uses Software

• Coq

This page was built for publication: The Negligible and Yet Subtle Cost of Pattern Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056004)