Sciweavers

Share
TLCA
2005
Springer
9 years 23 days ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive deļ¬nitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
books