Pattern matching as cut elimination
type: Item
instance of: scholarly article
title: Pattern matching as cut elimination
zbMATH Open document ID: 1078.68135
author: Serenella Cerrito
author: Delia Kesner
published in: Theoretical Computer Science
publication date: 2004-10-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 2105256
zbMATH Keywords: typed pattern calculus
describes a project that uses: MiniML
describes a project that uses: ML
describes a project that uses: Miranda
describes a project that uses: Haskell
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.03.032
OpenAlex ID: W2021119395
cites work: Explicit substitutions
cites work: Computational interpretations of linear logic
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: λν, a calculus of explicit substitutions which preserves strong normalisation
cites work: Combinatory reduction systems with explicit substitution that preserve strong normalisation
cites work: The rewriting calculus. I
cites work: A modal analysis of staged computation
cites work: Orderings for term-rewriting systems
cites work: Q4385532
cites work: Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation
cites work: Q3743300
cites work: Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
cites work: Q4288818
cites work: Q4474830
cites work: Abstract data type systems
cites work: Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
cites work: A typed pattern calculus
cites work: Q3997016
cites work: Q3024846
cites work: Q3721784
cites work: Q4938608
cites work: Cut rules and explicit substitutions
DOI: 10.1016/J.TCS.2004.03.032
description: scientific article; zbMATH DE number 2105256