4 search results - page 1 / 1 » Type Inference with Structural Subtyping: A Faithful Formali... |
APLAS
2003
ACM
2003
ACM
Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver
13 years 10 months ago
POPL
1998
ACM
13 years 9 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
ICFP
2008
ACM
14 years 4 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
SCP
2010
13 years 3 months ago
2010
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...