• Publications
  • Influence
Full Abstraction for Resource Calculus with Tests
TLDR
We study the semantics of a resource sensitive extension of the lambda-calculus in a canonical reflexive object of a category of sets and relations, a relational version of the original Scott D infinity model of the pure lambda-Calculus. Expand
  • 15
  • 2
  • PDF
Exponentials with Infinite Multiplicities
TLDR
We define an exponential functor on the category of sets and relations which allows to define a denotational model of differential linear logic and of the lambda-calculus with resources. Expand
  • 13
  • 2
  • PDF
A Semantical and Operational Account of Call-by-Value Solvability
TLDR
In Plotkin’s call-by-value lambda-calculus, solvable terms are characterized syntactically by means of call by-name reductions and there is no neat semantical characterization of such terms. Expand
  • 41
  • 1
  • PDF
The stack calculus
TLDR
We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded. Expand
  • 8
  • 1
  • PDF
Graph easy sets of mute lambda terms
TLDR
We define for each natural number n, an infinite and recursive set M n of mute terms, and show that it is graph-easy: for any closed term t of the lambda calculus there exists a graph model equating all the terms of M n to t. Expand
  • 8
  • 1
  • PDF
Easy lambda-terms are not always simple
TLDR
A closed λ -term M is easy if, for any other closed term N , the lambda theory generated by M is consistent. Expand
  • 4
  • 1
  • PDF
Non-interference by Unfolding
TLDR
The concept of non-interference has been introduced to characterise the absence of undesired information flows in a computing system. Expand
  • 9
  • PDF
Ordered Models of the Lambda Calculus
TLDR
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model with bottom element. Expand
  • 7
  • PDF
A Causal View on Non-Interference
TLDR
We show that BNDC admits natural characterisations based on the unfolding seman- tics - a classical true concurrent semantics for Petri nets - in terms of causalities and conflicts between high and low level activities. Expand
  • 7
Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus
  • A. Carraro, A. Salibra
  • Mathematics, Computer Science
  • 24th Annual IEEE Symposium on Logic In Computer…
  • 11 August 2009
TLDR
A longstanding open problem is whether there exists a model of the untyped lambda calculus in the category CPO of complete partial orderings and Scott continuous functions, whose theory is exactly the least lambda- theory lambda-beta or the least extensional lambda-theorylambda-beta-eta. Expand
  • 10
  • PDF
...
1
2
3
...