5 search results - page 1 / 1 » Lexical Scoping as Universal Quantification |
ICLP
1989
Springer
13 years 9 months ago
1989
Springer
APAL
2008
13 years 5 months ago
2008
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
AGI
2008
13 years 7 months ago
2008
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...
PLDI
1995
ACM
13 years 9 months ago
1995
ACM
d Abstract) Alexander Aiken Manuel F¨ahndrich Raph Levieny Computer Science Division University of California, Berkeleyz Static memory managementreplaces runtime garbage collecti...
POPL
1999
ACM
13 years 9 months ago
1999
ACM
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...