1017 search results - page 131 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
ISTA
2003
14 years 11 months ago
2003
: A new approach of building enterprise distributed applications for layer of business rules as standard part of architecture is proposed in this paper. The approach uses symbolic ...
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
KBSE
2010
IEEE
14 years 8 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
ICFP
2002
ACM
15 years 9 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
176
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...