{"version":"1.0","type":"link","title":"Pure type system - Newikis","description":"In the branches of mathematical logic known as proof theory and type theory, a pure type system (PTS), previously known as a generalized type system (GTS), is a form of typed lambda calculus that allows an arbitrary number of sorts and dependencies between any of these. The framework can be seen as…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}