Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control

DOI10.1007/978-3-319-89366-2_15zbMath1504.68034arXiv1803.00914OpenAlexW2963769921MaRDI QIDQ1652990

Hugo Herbelin, Étienne Miquey

Publication date: 17 July 2018

Full work available at URL: https://arxiv.org/abs/1803.00914

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Stateful Realizers for Nonstandard Analysis ⋮ Abstracting models of strong normalization for classical calculi

This page was built for publication: Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control