Sciweavers

37 search results - page 4 / 8
» Type inference in intuitionistic linear logic
Sort
View
FLOPS
2004
Springer
13 years 11 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
ICFP
2010
ACM
13 years 6 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
CSL
2009
Springer
14 years 19 days ago
Enriching an Effect Calculus with Linear Types
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
ENTCS
2011
129views more  ENTCS 2011»
13 years 1 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
JSYML
2000
110views more  JSYML 2000»
13 years 5 months ago
Basic Logic: Reflection, Symmetry, Visibility
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and ...
Giovanni Sambin, Giulia Battilotti, Claudia Faggia...