Lazy pattern matching in the ML language
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
1st international workshop on Conditional Term Rewriting Systems
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Matching - A special case of unification?
Journal of Symbolic Computation
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
The clausal theory of types
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A feature constraint system for logic programming with entailment
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Theoretical Computer Science - Special issue: algebraic development techniques
A lambda calculus of objects with self-inflicted extension
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Theory of Objects
A lambda calculus of objects and method specialization
Nordic Journal of Computing
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Decidability of fourth-order matching
Mathematical Structures in Computer Science
Associative commutative pattern matching
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Exceptions in the Rewriting Calculus
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A Conditional Logical Framework
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Rule-based programming and proving: the ELAN experience outcomes
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Hi-index | 0.00 |
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to encode complex structures such as lists, sets, and objects. We provide extensive examples of the calculus, and we focus on its ability to represent some object oriented calculi, namely the Lambda Calculus of Objects of Fisher, Honsell, and Mitchell, and the Object Calculus of Abadi and Cardelli. Furthermore, the calculus allows us to get object oriented constructions unreachable in other calculi. In summa, we intend to show that because of its matching ability, the Rho Calculus represents a lingua franca to naturally encode many paradigms of computations. This enlightens the capabilities of the rewriting calculus based language ELAN to be used as a logical as well as powerful semantical framework.