177 search results - page 10 / 36 » Linearizing Intuitionistic Implication |
CADE
2008
Springer
13 years 9 months ago
2008
Springer
It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a va...
LISP
2002
13 years 7 months ago
2002
Abstract. Continuations can be used to explain a wide variety of control behaviours, including calling/returning (procedures), raising/handling (exceptions), labelled jumping (goto...
PADL
2007
Springer
14 years 1 months ago
2007
Springer
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
CP
2005
Springer
13 years 9 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
FOSSACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...