43 search results - page 3 / 9 » Proving ML Type Soundness Within Coq |
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to d...
TLCA
1995
Springer
13 years 11 months ago
1995
Springer
operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a ...
APLAS
2000
ACM
13 years 12 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...
TLDI
2010
ACM
14 years 4 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...