We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Reï...
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
Five implementations of di erent lazy functional languages are compared using a common benchmark of a dozen medium size programs. The benchmarking procedure has been designed such...
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...