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

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.

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings vol. AF,...; no. Proceedings; pp. 97 - 108
Main Authors:	Nour, Karim, Saber, Khelifa
Format:	Journal Article Conference Proceeding
Language:	English
Published:	DMTCS 01.01.2005 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Series:	DMTCS Proceedings
Subjects:	[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 church-rosser complete development Computer Science Logic in Computer Science parallel reduction propositional classical logic Symbolic Computation Church-Rosser Parallel reduction Call-by-value Complete development Propositional classical logic
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	1365-8050 1462-7264 1365-8050
DOI:	10.46298/dmtcs.3470