Explicit Substitutions for the Lambda-Mu-Calculus.

Abstract : We present a confluent rewriting system wich extends a previous calculus for the Lambda-Calculus (Levy, Hardin) to Parigot's untyped Lambda-Mu-Calculus. This extension embeds the Lambda- Mu-Calculus as a sub-theory, and provides the basis for a theoretical framework to study the abstract properties of implementations of functional programming languages enriched with control structures. This study gives also some interesting feedback on Lambda-Mu-Calculus on both the syntactical and semantics levels.
Document type :
Reports
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102044
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:12:46 AM
Last modification on : Wednesday, November 20, 2019 - 3:14:24 AM

File

RR1994-26.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102044, version 1

Collections

Citation

Philippe Audebaud. Explicit Substitutions for the Lambda-Mu-Calculus.. [Research Report] LIp RR-1994-26, Laboratoire de l'informatique du parallélisme. 1994, 2+14p. ⟨hal-02102044⟩

Share

Metrics

Record views

5

Files downloads

17