499 search results - page 6 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
118
click to vote
LICS
1995
IEEE
15 years 1 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
CP
2005
Springer
14 years 11 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
LOPSTR
2004
Springer
15 years 2 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
APAL
2010
14 years 9 months ago
2010
ICALP
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...