The multiset-based relational model of linear logic induces a semantics of the untyped λ-
calculus, which corresponds with a non-idempotent intersection type system, System R. We …

Since the very beginning of the theory of linear logic it is known how to represent the λ λ-
calculus as linear logic proof nets. The two systems however have different granularities, in …

This paper gives a detailed account of the relationship between (a variant of) the call-by-
value lambda calculus and linear logic proof nets. The presentation is carefully tuned in …

A rooted planar map is a connected graph embedded in the 2-sphere, with one edge
marked and assigned an orientation. A term of the pure lambda calculus is said to be linear …

The sequential nature of sequent calculus provides a simple definition of cut-elimination
rules that duplicate or erase sub-proofs. The parallel nature of proof nets, instead, requires …

This thesis provides a clarification of Girard's recent work entitled" transcendental syntax".
Girard suggests a reorganisation and a reinterpretation of concepts of mathematical logic …

We show that there are connections between principal type schemata, cut-free λ-nets, and
normal forms of the λ-calculus, and hence there are correspondences between the …

The paper presents an implementation of virtual studio visualization tools in the decorative
arts museum collections. Live DV video 2d images are embedded in a Java 3D Environment …

The relational semantics for Linear Logic induces a semantics for the type free Lambda
Calculus. This one is built on non-idempotent intersection types. We give a principal typing …

This dissertation deals with type systems which guarantee polynomial time complexity of
typed programs. Such algorithms are commonly regarded as being feasible for practical …