Pattern matching without K
From MaRDI portal
Publication:2819686
DOI10.1145/2628136.2628139zbMath1345.68045OpenAlexW2158830522MaRDI QIDQ2819686
Jesper Cockx, Frank Piessens, Dominique Devriese
Publication date: 29 September 2016
Published in: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/452283
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Subtyping without reduction ⋮ Leibniz equality is isomorphic to Martin-Löf identity, parametrically ⋮ Eliminating dependent pattern matching without K ⋮ Programming with ornaments
Uses Software
This page was built for publication: Pattern matching without K
