1131 search results - page 195 / 227 » Logic Programming, Functional Programming, and Inductive Def... |
96
Voted
APAL
2008
15 years 16 days ago
2008
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
143
Voted
KDD
2003
ACM
16 years 24 days ago
2003
ACM
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
105
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
149
click to vote
DIMACS
1996
15 years 1 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
133
Voted
CC
2006
Springer
15 years 4 months ago
2006
Springer
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...