Combining Higher-Order and First-Order Computation Using ρ-calculus: Towards a Semantics of ELAN (1999)
| Venue: | In Frontiers of Combining Systems 2 |
| Citations: | 18 - 8 self |
BibTeX
@INPROCEEDINGS{Cirstea99combininghigher-order,
author = {Horatiu Cirstea and Claude Kirchner},
title = {Combining Higher-Order and First-Order Computation Using ρ-calculus: Towards a Semantics of ELAN},
booktitle = {In Frontiers of Combining Systems 2},
year = {1999},
pages = {95--120},
publisher = {Wiley}
}
OpenURL
Abstract
The ρ-calculus permits to express in a uniform and simple way firstorder rewriting, λ-calculus and non-deterministic computations as well as their combination. In this paper, we present the main components of the ρ-calculus and we give a full first-order presentation of this rewriting calculus using an explicit substitution setting, called ρσ, that generalizes the λσ-calculus. The basic properties of the non-explicit and explicit substitution versions are presented. We then detail how to use the ρ-calculus to give an operational semantics to the rewrite rules of the ELAN language. 1







