4617 search results - page 718 / 924 » Automation of Diagrammatic Reasoning |
177
click to vote
LICS
2005
IEEE
16 years 23 days ago
2005
IEEE
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisa...
195
click to vote
LICS
2005
IEEE
16 years 23 days ago
2005
IEEE
A path-based domain theory for higher-order processes is extended to allow name generation. The original domain theory is built around the monoidal-closed category Lin consisting ...
170
click to vote
TPHOL
2005
IEEE
16 years 23 days ago
2005
IEEE
The Verisoft project aims at the pervasive formal verification of entire computer systems. In particular, the seamless verification of the academic system is attempted. This syst...
178
click to vote
TPHOL
2005
IEEE
16 years 23 days ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
183
click to vote
TPHOL
2005
IEEE
16 years 23 days ago
2005
IEEE
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...