321 search results - page 2 / 65 » Programming with ASN.1 Using Polymorphic Types and Type Spec... |
POPL
2009
ACM
14 years 5 months ago
2009
ACM
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...
ESOP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
ICLP
1995
Springer
13 years 8 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
TACS
1994
Springer
13 years 9 months ago
1994
Springer
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...
HASKELL
2005
ACM
13 years 10 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...