Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The call-by-value λµ ...
Conference paper

The call-by-value λµ∧∨-calculus

Karim Nour ORCID (1), Khelifa Saber (1)
(1) Laboratoire de Mathématiques
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AF, Computational Logic and Applications (CLA '05)
Proceedings
DOI
10.46298/dmtcs.3470
License
https://about.hal.science/hal-authorisation-v1
Indicators
541
Views
414
Downloads

The call-by-value λµ∧∨-calculus

Karim Nour ORCID (1), Khelifa Saber (1)
(1) Laboratoire de Mathématiques
Abstract
In this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an adaptation of that of Andou (2003) which uses an extended parallel reduction method and complete development.
Keywords
  • [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
  • [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
  • Call-by-value
  • Propositional classical logic
  • Parallel reduction
  • Complete development
  • Church-Rosser
Preview
Loading PDF preview...