1017 search results - page 163 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
PLDI
2005
ACM
15 years 3 months ago
2005
ACM
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
DLT
2006
14 years 11 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
SAS
1999
Springer
15 years 1 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
191
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
150
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous ope...