680 search results - page 55 / 136 » Types for the Ambient Calculus |
LFCS
2007
Springer
14 years 3 months ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
PPDP
2005
Springer
14 years 2 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
CADE
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
LICS
2012
IEEE
11 years 11 months ago
2012
IEEE
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...