Pure patterns type systems

DOI10.1145/604131.604152zbMath1321.68137OpenAlexW2018854027MaRDI QIDQ2942930

Luigi Liquori, Horatiu Cirstea, Gilles Barthe, Claude Kirchner

Publication date: 11 September 2015

Published in: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00099463v2/file/2003-popl-03.pdf

zbMATH Keywords

matchinglogicsrewritingpure type systemspatternslambda-calculusCurry-Howard

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (16)

Expressing combinatory reduction systems derivations in the rewriting calculus ⋮ A \(\rho\)-calculus of explicit constraint application ⋮ Lambda calculus with patterns ⋮ Type soundness for path polymorphism ⋮ Narrowing Based Inductive Proof Search ⋮ Unnamed Item ⋮ Abstract canonical presentations ⋮ On the confluence of lambda-calculus with conditional rewriting ⋮ Semantic foundations for generalized rewrite theories ⋮ First-class patterns ⋮ A Polymorphic Type System for the Lambda-Calculus with Constructors ⋮ A Framework for Defining Logical Frameworks ⋮ Term Collections in λ and ρ-calculi ⋮ From Functional Programs to Interaction Nets via the Rewriting Calculus ⋮ Imperative LF Meta-Programming ⋮ Towards a Sharing Strategy for the Graph Rewriting Calculus

Uses Software

• TREX

Cites Work

• Regular expression pattern matching for XML
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pure patterns type systems