1017 search results - page 9 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
213
click to vote
ICFP
1997
ACM
15 years 10 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
160
click to vote
ESOP
2009
Springer
16 years 20 days ago
2009
Springer
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...
174
click to vote
LICS
2008
IEEE
16 years 8 days ago
2008
IEEE
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
173
click to vote
CHARME
2003
Springer
15 years 11 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
175
click to vote
LISP
2007
15 years 5 months ago
2007
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...