Abstract
Plotkin used the models of reduction in order to obtain a semantic characterization of static type inference in the pure λ-calculus. Here we apply these models to the study of a nondeterministic language, obtaining results analogous to Plotkin′s.
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
