2529 search results - page 279 / 506 » The Logical Structure of Binding |
151
click to vote
APAL
2010
15 years 6 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
233
click to vote
TOCL
2012
13 years 9 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
224
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
166
click to vote
TIME
2008
IEEE
16 years 1 months ago
2008
IEEE
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...
172
click to vote
IDEAL
2005
Springer
16 years 4 days ago
2005
Springer
Artificial neural networks play an important role for pattern recognition tasks. However, due to poor comprehensibility of the learned network, and the inability to represent expl...