Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus
type: Item
instance of: scholarly article
title: Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus
zbMATH Open document ID: 1018.68016
DOI: 10.1016/S0304-3975(01)00380-2
author: Koji Nakazawa
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 1857119
zbMATH Keywords: call-by-value -calculus
zbMATH Keywords: domain-free type system
zbMATH Keywords: confluency
zbMATH Keywords: strong normalizability
zbMATH Keywords: CPS-translation
describes a project that uses: Automath
MaRDI profile type: Publication
cites work: Parallel reduction in type free lambda/mu-calculus
cites work: A strong normalization result for classical logic
cites work: Q3342534
cites work: \(\lambda\mu\)-calculus and Böhm's theorem
cites work: Q4954443
cites work: Q3024836
cites work: A syntactic theory of sequential control
cites work: Q4263869
cites work: Domain-free \(\lambda\mu\)-calculus
cites work: The system \({\mathcal F}\) of variable types, fifteen years later
cites work: Q3994895
cites work: Q4255509
cites work: Proofs of strong normalisation for second order classical natural deduction
cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus
full work available at URL: s0304-3975(01)00380-2
OpenAlex ID: W1968553947
description: scientific article; zbMATH DE number 1857119