Abstract
Pure type systems feature domain-specified λ-abstractions λx:A.M. We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free λ-abstractions λx.M. We study the basic properties of domain-free pure type systems and establish their formal relationship with pure type systems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
