The undecidability of pattern matching in calculi where primitive recursive functions are representable
From MaRDI portal
No records found
Cited in
No records found
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )