3238 search results - page 98 / 648 » On the Computational Interpretation of Negation |
ICMAS
2000
13 years 11 months ago
2000
In this paper, I motivate, define, and illustrate the notion of computationally grounded theories of agency. A theory of agency is said to be computationally grounded if we can gi...
MPC
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
CODES
2002
IEEE
14 years 3 months ago
2002
IEEE
We introduce a new kernel language for modeling hardware/software systems, adopting multiple heterogenous models of computation. The language has formal operational semantics, and...
ENTCS
2008
13 years 10 months ago
2008
abstraction and quantum computation Alessandra Di Pierro1 Dipartimento di Informatica University of Pisa Pisa, Italy Herbert Wiklicky2 Department of Computing Imperial College Lond...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....