171 search results - page 24 / 35 » Classical Logic, Continuation Semantics and Abstract Machine... |
167
click to vote
POPL
2007
ACM
15 years 9 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
113
Voted
ICCL
1992
IEEE
15 years 1 months ago
1992
IEEE
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
78
Voted
DIS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP...
ICFP
2002
ACM
15 years 9 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
JUCS
2006
14 years 9 months ago
2006
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...