Sciweavers

2 search results - page 1 / 1
» Unrestricted pure call-by-value recursion
Sort
View
ML
2008
ACM
13 years 4 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
POPL
2009
ACM
14 years 5 months ago
State-dependent representation independence
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
Amal Ahmed, Derek Dreyer, Andreas Rossberg