Fast verified BCD subtyping

DOI10.1007/978-3-030-22348-9_21zbMath1519.68044OpenAlexW2954399557MaRDI QIDQ6165818

Boris Düdder, Jakob Rehof, Jan Bessai

Publication date: 2 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-030-22348-9_21

zbMATH Keywords

intersection typessubtypingCoqBCD

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Taming the Merge Operator

This page was built for publication: Fast verified BCD subtyping