Lambda calculus with patterns

DOI10.1016/j.tcs.2008.01.019zbMath1145.68012OpenAlexW2038167131MaRDI QIDQ930865

Vincent van Oostrom, Roel de Vrijer, Jan Willem Klop

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.019

zbMATH Keywords

orthogonalitylambda calculuscombinatory reduction systemsChurch-Rosserrigid pattern conditionunique normal forms

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (14)

Sharing in the Graph Rewriting Calculus ⋮ The Negligible and Yet Subtle Cost of Pattern Matching ⋮ ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti ⋮ Unnamed Item ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Typed path polymorphism ⋮ Pure pattern calculus à la de Bruijn ⋮ Expression reduction systems with patterns ⋮ Unnamed Item ⋮ First-class patterns ⋮ Unnamed Item ⋮ A Framework for Defining Logical Frameworks ⋮ From Functional Programs to Interaction Nets via the Rewriting Calculus ⋮ Distributive ρ-calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional linearization
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• Term-rewriting systems with rule priorities
• A Framework for Defining Logical Frameworks
• Pure patterns type systems
• Unique normal form property of Higher-Order Rewriting Systems
• Functional and Logic Programming
• Types for Proofs and Programs
• The Rewriting Calculus as a Combinatory Reduction System
• Programming Languages and Systems

This page was built for publication: Lambda calculus with patterns