The rho cube

DOI10.1007/3-540-45315-6_11MaRDI QIDQ2769430zbMATH OpenFDO

Authors Horatiu Cirstea, Claude Kirchner, Luigi Liquori

Publication date 5 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2030/20300168

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Recommendations

• The rewriting calculus. I
• A \(\rho\)-calculus of explicit constraint application
• Rewriting calculus with(out) types
• Types for Proofs and Programs
• The polymorphic rewriting-calculus [type checking vs. type inference]

Cited in

(23)

• Typed generic traversal with term rewriting strategies
• ELAN from a rewriting logic point of view
• Rewriting logic: Roadmap and bibliography
• Type soundness for path polymorphism
• Twenty years of rewriting logic
• A symbolic transformation language and its application to a multiscale method
• Abstract canonical presentations
• Semantic foundations for generalized rewrite theories
• The rewriting calculus. I
• The rewriting calculus. II
• Sharir's cube
• Generic type-preserving traversal strategies
• Certifying term rewriting proofs in ELAN
• The polymorphic rewriting-calculus [type checking vs. type inference]
• Rewriting calculus with(out) types
• The cube and the Burnside category
• A Polymorphic Type System for the Lambda-Calculus with Constructors
• Costas cubes
• The vectorial \(\lambda\)-calculus
• Types for Proofs and Programs
• The Rewriting Calculus as a Combinatory Reduction System
• Expressing combinatory reduction systems derivations in the rewriting calculus
• A \(\rho\)-calculus of explicit constraint application

This page was built for publication: The rho cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2769430)