4513 search results - page 506 / 903 » Logic programming with satisfiability |
160
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
180
click to vote
SAS
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
202
Voted
JFP
2007
15 years 6 months ago
2007
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
179
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
175
Voted
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...