Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
From MaRDI portal
Publication:4530146
DOI<357::AID-MALQ357>3.0.CO;2-L 10.1002/1521-3870(200204)48:3<357::AID-MALQ357>3.0.CO;2-LzbMath0997.03015arXiv0905.0456MaRDI QIDQ4530146
Publication date: 13 November 2002
Full work available at URL: https://arxiv.org/abs/0905.0456
confluence; strong normalization; data types; subject reduction; extension of \(\lambda\mu\)-calculus; nondeterministic classical logic; parallel-or
68N18: Functional programming and lambda calculus
03B70: Logic in computer science
03B40: Combinatory logic and lambda calculus
Related Items
Normalization in the simply typed -calculus, Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
Cites Work