A trace semantics for System F parametric polymorphism

DOI10.1007/978-3-319-89366-2_2zbMath1504.68124OpenAlexW2796781183MaRDI QIDQ1652964

Guilhem Jaber, Nikos Tzevelekos

Publication date: 17 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-89366-2_2

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Related Items (2)

(Towards a) statistical probabilistic lazy lambda calculus ⋮ Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms

This page was built for publication: A trace semantics for System F parametric polymorphism