643 search results - page 88 / 129 » Semantic Determinism and Functional Logic Program Properties |
121
click to vote
JELIA
1990
Springer
15 years 6 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
114
click to vote
PEPM
2010
ACM
15 years 10 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
107
Voted
AGP
1998
IEEE
15 years 5 months ago
1998
IEEE
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
111
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
162
Voted
ESOP
2000
Springer
15 years 5 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...