Sciweavers

177 search results - page 13 / 36
» Linearizing Intuitionistic Implication
Sort
View
TCS
2010
13 years 6 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
ENTCS
2011
129views more  ENTCS 2011»
13 years 2 months ago
Specifying Proof Systems in Linear Logic with Subexponentials
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
Vivek Nigam, Elaine Pimentel, Giselle Reis
TLCA
2005
Springer
14 years 1 months ago
A Lambda Calculus for Quantum Computation with Classical Control
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Peter Selinger, Benoît Valiron
LISP
2002
80views more  LISP 2002»
13 years 7 months ago
Comparing Control Constructs by Double-Barrelled CPS
We investigate call-by-value continuation-passing style transforms that continuations. Altering a single variable in the translation of -abstraction gives rise to different control...
Hayo Thielecke
LICS
2010
IEEE
13 years 6 months ago
The Undecidability of Boolean BI through Phase Semantics
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
Dominique Larchey-Wendling, Didier Galmiche