75 search results - page 7 / 15 » Separate Compilation for Standard ML |
APLAS
2000
ACM
15 years 2 months ago
2000
ACM
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
IFL
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We describe the architecture of a virtual machine for executing functional logic programming languages. A distinguishing feature of our machine is that it preserves the o...
ML
2008
ACM
14 years 10 months ago
2008
ACM
We present a way to run Objective Caml programs on a standard, unmodified web browser, with a compatible data representation and execution model, including concurrency. To achieve...
104
click to vote
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
RTS
2000
14 years 9 months ago
2000
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...