Equational axiomatization of bicoercibility for polymorphic types

DOI10.1007/3-540-60692-0_47zbMath1354.68049OpenAlexW1577658767MaRDI QIDQ2956681

Jerzy Tiuryn

Publication date: 19 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60692-0_47

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Logic in computer science (03B70)

Related Items (3)

The subtyping problem for second-order types is undecidable. ⋮ Coercion completion and conservativity in coercive subtyping ⋮ A sequent calculus for subtyping polymorphic types

This page was built for publication: Equational axiomatization of bicoercibility for polymorphic types