3481 search results - page 447 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
131
click to vote
PLSA
1994
15 years 8 months ago
1994
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
144
click to vote
SIGSOFT
2002
ACM
16 years 5 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
144
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
161
click to vote
CADE
1990
Springer
15 years 8 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
140
click to vote
EACL
2003
ACL Anthology
15 years 5 months ago
2003
ACL Anthology
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...