scispace - formally typeset
Open AccessJournal ArticleDOI

Intuitionistic differential nets and lambda-calculus

Paolo Tranquilli
- 01 Apr 2011 - 
- Vol. 412, Iss: 20, pp 1979-1997
Reads0
Chats0
TLDR
Normalization of the exponential reduction and confluence of the full one is proved and a translation of Boudol?s untyped ?-calculus with resources extended with a linear?nonlinear reduction a la Ehrhard and Regnier?s differential ?
About: 
This article is published in Theoretical Computer Science.The article was published on 2011-04-01 and is currently open access. It has received 44 citations till now. The article focuses on the topics: Interaction nets & Geometry of interaction.

read more

Citations
More filters
Proceedings ArticleDOI

Collapsing non-idempotent intersection types

Thomas Ehrhard
TL;DR: This work construction of a new model, which features a new duality, is presented, and how to use it for reducing normalization results in idempotent intersection types to purely combinatorial methods is explained.
Book ChapterDOI

Solvability in resource lambda-calculus

Michele Pagani, +1 more
TL;DR: This work defines a term solvable whenever there is a simple head context reducing the term into a sum where at least one addend is the identity, and gives a syntactical, operational and logical characterization of this kind of solvability.
Journal ArticleDOI

Linearity, Non-determinism and Solvability

Michele Pagani, +1 more
- 01 Jan 2010 - 
TL;DR: This work studies the notion of solvability in the resource calculus, an extension of the λ-calculus modelling resource consumption, and gives a syntactical, operational and logical characterization for the may-solvability and only a partial characterization of the must-solvable.
Journal ArticleDOI

Proof nets and the call-by-value λ-calculus

Beniamino Accattoli
- 16 Nov 2015 - 
TL;DR: This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets, and identifies a subcalculus that is shown to be as expressive as the full calculus.
Book ChapterDOI

Parallel Reduction in Resource Lambda-Calculus

Michele Pagani, +1 more
TL;DR: This work defines parallel reduction in resource calculus and applies the technique by Tait and Martin-Lof to achieve confluence, and slightly generalizes a technique by Takahashi to obtain a standardization result.
References
More filters
Journal ArticleDOI

Linear logic

Jean-Yves Girard
Journal ArticleDOI

Linear logic

Patrick Lincoln
- 01 May 1992 - 
TL;DR: This column presents an intuitive overview of linear logic, some recent theoretical results, and summarizes several applications oflinear logic to computer science.
Journal ArticleDOI

Fiftieth volume of theoretical computer science

Maurice Nivat
- 01 Jan 1988 - 
TL;DR: This contribution was made possible only by the miraculous fact that the first members of the Editorial Board were sharing the same conviction about the necessity of Theoretical Computer Science.
Journal ArticleDOI

The structure of multiplicatives

Vincent Danos, +1 more
- 01 Oct 1989 - 
TL;DR: Investigating Girard's new propositionnal calculus, which aims at a large scale study of computation, there is a stumble quickly on that question: What is a multiplicative connective?
Journal ArticleDOI

The differential Lambda-calculus

Thomas Ehrhard, +1 more
- 02 Dec 2003 - 
TL;DR: This work presents an extension of the lambda-calculus with differential constructions, and state and prove some basic results (confluence, strong normalization in the typed case), and also a theorem relating the usual Taylor series of analysis to the linear head reduction of lambda-Calculus.