108 search results - page 16 / 22 » Constructing Free Boolean Categories |
WADT
1998
Springer
15 years 1 months ago
1998
Springer
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
SCA
2007
15 years 4 days ago
2007
We present a simple yet powerful approach for the generation and rendering of surfaces defined by the boundary of a three-dimensional point cloud. First, a depth map plus internal...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
111
click to vote
ICFP
2012
ACM
13 years 4 days ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
CCS
2003
ACM
15 years 3 months ago
2003
ACM
This paper describes a system and annotation language, MECA, for checking security rules. MECA is expressive and designed for checking real systems. It provides a variety of pract...