?

Log in

Why does a Turing-complete type system make type checking undecidable? - Lindsey Kuper [entries|archive|friends|userinfo]
Lindsey Kuper

[ website | composition.al ]
[ userinfo | livejournal userinfo ]
[ archive | journal archive ]

Why does a Turing-complete type system make type checking undecidable? [Feb. 27th, 2017|06:50 pm]
Lindsey Kuper
[Tags|]

New blog post, in which I make various embarrassing realizations.

This entry was originally posted at http://lindseykuper.dreamwidth.org/10630.html. Please comment there using OpenID.
LinkReply