A \(\rho\)-calculus of explicit constraint application
From MaRDI portal
Publication:880989
DOI10.1007/s10990-007-9004-2zbMath1115.68094OpenAlexW2155327735MaRDI QIDQ880989
Horatiu Cirstea, Claude Kirchner, Germain Faure
Publication date: 21 May 2007
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00000628v3/file/paper.pdf
Related Items
Expressing combinatory reduction systems derivations in the rewriting calculus, A \(\rho\)-calculus of explicit constraint application, Unnamed Item
Uses Software
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Choices in representation and reduction strategies for lambda terms in intensional contexts
- A \(\rho\)-calculus of explicit constraint application
- Edinburgh LCF. A mechanized logic of computation
- Higher order unification via explicit substitutions
- External rewriting for skeptical proof assistants
- The force on an elastic singularity in a nonhomogeneous medium
- A λ-calculus with explicit weakening and explicit substitution
- The rewriting calculus - part II
- Formal Validation of Pattern Matching code
- Pure patterns type systems
- Director Strings Revisited: A Generic Approach to the Efficient Representation of Free Variables in Higher-order Rewriting
- A consistent extension of the lambda-calculus as a base for functional programming languages
- A Rewriting System for Categorical Combinators with Multiple Arguments
- iRho: an imperative rewriting calculus
- Completion of a Set of Rules Modulo a Set of Equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Confluence properties of weak and strong calculi of explicit substitutions
- The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations
- Explicit substitutions
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Term Rewriting and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item