247 search results - page 12 / 50 » A Computational Structure for the Propositional Calculus |
GG
2008
Springer
13 years 8 months ago
2008
Springer
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
LACL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences ...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
ENTCS
2010
13 years 7 months ago
2010
The notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by structured computations in general. We claim that an arrow also serves as a basic compon...