32 search results - page 3 / 7 » Modified Realizability Interpretation of Classical Linear Lo... |
MSCS
2007
13 years 7 months ago
2007
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
AMAST
2006
Springer
13 years 11 months ago
2006
Springer
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
FLOPS
2004
Springer
14 years 28 days ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
CONTEXT
2007
Springer
14 years 1 months ago
2007
Springer
Contextual Graphs are a context-based formalism used in various real-world applications. They allow a uniform representation of elements of reasoning and of contexts for describing...