Sciweavers

238 search results - page 10 / 48
» Program Abstraction in a Higher-Order Logic Framework
Sort
View
SLP
1990
121views more  SLP 1990»
13 years 9 months ago
Analysis of Constraint Logic Programs
eric abstract interpretation framework. The results show significant benefits when using the proposed incremental analysis algorithms.
Kim Marriott, Harald Søndergaard
POPL
2006
ACM
14 years 9 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
LPNMR
2007
Springer
14 years 2 months ago
A Preference-Based Framework for Updating Logic Programs
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
James P. Delgrande, Torsten Schaub, Hans Tompits
ICFP
2003
ACM
14 years 8 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
TPHOL
2003
IEEE
14 years 1 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd