Year: 1990
Type: conference-paper
Abstract: Two abstract machines reducing terms to their full normal form are presented in this paper. They are based on Krivine's abstract machine [Kri85] which uses an environment to store arguments of function calls. A proof of their correctness is then stated in the abstract framework of λσ-calculus [Cur89].
DOI: 10.1145/91556.91681
Author: P. Crégut
Institution: Centre National de la Recherche Scientifique
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2012068558
