584 search results - page 83 / 117 » Logic Programs as term Rewriting Systems |
POPL
2010
ACM
15 years 7 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
POPL
2011
ACM
14 years 16 days ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...