3481 search results - page 273 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
151
click to vote
LOGCOM
2010
14 years 11 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
260
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
131
click to vote
ICAI
2004
15 years 5 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
180
click to vote
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
135
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...