61 search results - page 10 / 13 » A Simple Semantics for ML Polymorphism |
GI
2009
Springer
14 years 3 months ago
2009
Springer
: In this paper we present the concurrent constraint functional programming CCFL and an abstract machine for the evaluation of CCFL programs in a multicore environment. The source ...
ECOOP
2000
Springer
14 years 3 months ago
2000
Springer
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
POPL
2004
ACM
14 years 11 months ago
2004
ACM
In the interest of designing a recursive module extension to ML that is as simple and general as possible, we propose a novel type system for general recursion over effectful expr...
ENTCS
2000
13 years 10 months ago
2000
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
FSEN
2009
Springer
14 years 5 months ago
2009
Springer
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...