13 search results - page 2 / 3 » A Modal Lambda Calculus with Iteration and Case Constructs |
CADE
2007
Springer
14 years 6 months ago
2007
Springer
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
POPL
2001
ACM
14 years 6 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
ECAI
1992
Springer
13 years 9 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
TLDI
2005
ACM
13 years 11 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...