921 search results - page 28 / 185 » Expressing Computational Complexity in Constructive Type The... |
DNA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...
INFORMATICALT
2007
13 years 7 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
ENTCS
1998
13 years 7 months ago
1998
We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli's imperative object calculus with operators for concurrency from the -calc...
LFCS
2009
Springer
14 years 2 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...