The Negligible and Yet Subtle Cost of Pattern Matching

DOI10.1007/978-3-319-71237-6_21zbMath1503.68034OpenAlexW2768840213MaRDI QIDQ5056004

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)

Related Items (3)

The Negligible and Yet Subtle Cost of Pattern Matching ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Coq

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lambda calculus with patterns
• A syntactic approach to type soundness
• Implementing open call-by-value
• The rewriting calculus - part I
• (Leftmost-Outermost) Beta Reduction is Invariant, Indeed
• Distilling abstract machines
• The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus
• Local Bigraphs and Confluence: Two Conjectures
• Call-by-Value Solvability, Revisited
• On the Value of Variables
• Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation
• A compiled implementation of strong reduction
• Open Call-by-Value
• The Theory of Calculi with Explicit Substitutions Revisited
• First-class patterns
• On Constructor Rewrite Systems and the Lambda-Calculus
• The call-by-need lambda calculus
• Deriving a lazy abstract machine
• The call-by-need lambda calculus
• On the Relative Usefulness of Fireballs
• Explicit substitutions
• The Negligible and Yet Subtle Cost of Pattern Matching
• New Developments in Environment Machines
• Modular, higher-order cardinality analysis in theory and practice
• A nonstandard standardization theorem
• Derivational Complexity Is an Invariant Cost Model

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