74 search results - page 15 / 15 » Type Inferencing for Polymorphic Order-Sorted Logic Programs |
184
Voted
TLDI
2010
ACM
15 years 11 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...
106
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
124
Voted
CADE
2001
Springer
16 years 3 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
122
Voted
OOPSLA
2005
Springer
15 years 8 months ago
2005
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...