632 search results - page 56 / 127 » Proving Invariants of Functional Programs |
106
Voted
PPDP
2004
Springer
15 years 6 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
139
click to vote
POPL
1992
ACM
15 years 4 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
165
Voted
PLDI
1997
ACM
15 years 4 months ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
108
click to vote
JFP
2000
15 years 11 days ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
120
click to vote
TPHOL
2005
IEEE
15 years 6 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...