Sciweavers

499 search results - page 7 / 100
» Logic Programming in a Fragment of Intuitionistic Linear Log...
Sort
View
TLCA
2007
Springer
15 years 3 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
APAL
2006
91views more  APAL 2006»
14 years 9 months ago
Computing interpolants in implicational logics
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...
Makoto Kanazawa
ENTCS
2006
141views more  ENTCS 2006»
14 years 9 months ago
A Concurrent Model for Linear Logic
We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and...
Emmanuel Beffara
ICALP
1998
Springer
15 years 1 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
IANDC
2010
91views more  IANDC 2010»
14 years 8 months ago
Functional interpretations of linear and intuitionistic logic
This article shows how different functional interpretations can be combined into what we term hybrid functional interpretations. These hybrid interpretations work on the setting o...
Paulo Oliva