A \(\rho\)-calculus of explicit constraint application
type: Item
instance of: scholarly article
title: A \(\rho\)-calculus of explicit constraint application
zbMATH Open document ID: 1115.68094
author: Horatiu Cirstea
author: Germain Faure
author: Claude Kirchner
published in: Higher-Order and Symbolic Computation
publication date: 2007-05-21T00:00:00Z
full work available at URL: paper.pdf
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5155278
zbMATH Keywords: Rewriting calculus
zbMATH Keywords: Explicit substitution
zbMATH Keywords: Explicit matching
zbMATH Keywords: Pattern matching
describes a project that uses: ATERM
describes a project that uses: Maude
describes a project that uses: LCF
describes a project that uses: ELAN
MaRDI profile type: Publication
OpenAlex ID: W2155327735
cites work: Explicit substitutions
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Pure patterns type systems
cites work: A consistent extension of the lambda-calculus as a base for functional programming languages
cites work: Q4222982
cites work: Q4223001
cites work: The rewriting calculus. II
cites work: Q2778872
cites work: Rewriting calculus with(out) types
cites work: Rewrite strategies in the rewriting calculus
cites work: Q4222853
cites work: Confluence properties of weak and strong calculi of explicit substitutions
cites work: A \(\lambda\)-calculus with explicit weakening and explicit substitution
cites work: Q4175528
cites work: Q5667469
cites work: Higher order unification via explicit substitutions
cites work: Q4808738
cites work: Edinburgh LCF. A mechanized logic of computation
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Completion of a Set of Rules Modulo a Set of Equations
cites work: Term Rewriting and Applications
cites work: The force on an elastic singularity in a nonhomogeneous medium
cites work: Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
cites work: Formal validation of pattern matching code
cites work: Q3918095
cites work: Choices in representation and reduction strategies for lambda terms in intensional contexts
cites work: iRho: an imperative rewriting calculus
cites work: Q4417783
cites work: The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations
cites work: External rewriting for skeptical proof assistants
cites work: Q4249892
cites work: Q4380997
cites work: Director Strings Revisited: A Generic Approach to the Efficient Representation of Free Variables in Higher-order Rewriting
cites work: CINNI -- a generic calculus of explicit substitutions and its application to \(\lambda\)-, \(\sigma\)- and \(\pi\)-calculi
cites work: A Rewriting System for Categorical Combinators with Multiple Arguments
DOI: 10.1007/S10990-007-9004-2
description: scientific article; zbMATH DE number 5155278