jmcarthur

ncInq :: NCID -> IO (Int, Int, Int, Int)
ncInq ncid = do
    alloca $ \ndims_ptr -> do
        alloca $ \nvars_ptr -> do
            alloca $ \natts_ptr -> do
                alloca $ \unlimdimid_ptr -> do
                    status     <- nc_inq ncid ndims_ptr nvars_ptr natts_ptr unlimdimid_ptr 
                    ndims      <- peek ndims_ptr
                    nvars      <- peek nvars_ptr
                    natts      <- peek natts_ptr

jmcarthur

ncInq :: NCID -> IO (Int, Int, Int, Int)
ncInq ncid =
  alloca $ \ndims_ptr ->
  alloca $ \nvars_ptr ->
  alloca $ \natts_ptr ->
  alloca $ \unlimdimid_ptr -> do
    status     <- nc_inq ncid ndims_ptr nvars_ptr natts_ptr unlimdimid_ptr 
    ndims      <- peek ndims_ptr
    nvars      <- peek nvars_ptr
    natts      <- peek natts_ptr

jmcarthur

enum ThunkData<T> {
    Val (T),
    Fun (~fn() -> T)
}
 
struct Thunk<T> {
    thunkData: ThunkData<T>
}
 
impl<T : Clone> Thunk<T> {

jmcarthur

struct Thunk<'a, T> {
    f : ~fn() -> & 'a T
}

jmcarthur

Here is a section of a message I sent to Francois-Regis Sinot regarding his paper 
Complete Laziness: A Natural Semantics
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/sinot-wrs07.pdf
---------------

I have simplified the problem down to this expression:

(\z. (\x. \y. x) (\w. z)) I I I

Where I is the identity function.  Preprocessing, this translates to (with some manual simplifications):