835 search results - page 51 / 167 » Geometric Logic in Computer Science |
ERSHOV
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Monads are a technique widely used in functional programming languages to address many different problems. This paper presents extensions, a functional-logic programming...
TLCA
1999
Springer
14 years 29 days ago
1999
Springer
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
TLCA
2009
Springer
14 years 3 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
STACS
1999
Springer
14 years 29 days ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
LICS
2006
IEEE
14 years 2 months ago
2006
IEEE
A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by conc...