Trace semantics for polymorphic references

DOI10.1145/2933575.2934509zbMath1401.68033arXiv1602.08406OpenAlexW2275729681MaRDI QIDQ4635919

Nikos Tzevelekos, Guilhem Jaber

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (4)

A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus ⋮ No value restriction is needed for algebraic effects and handlers ⋮ Complete trace models of state and control ⋮ Unnamed Item

This page was built for publication: Trace semantics for polymorphic references