Skip to main navigation Skip to search Skip to main content

The structural λ-calculus

  • Centre national de la recherche scientifique

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Inspired by a recent graphical formalism for λ-calculus based on Linear Logic technology, we introduce an untyped structural λ-calculus, called λj, which combines action at a distance with exponential rules decomposing the substitution by means of weakening, contraction and dereliction. Firstly, we prove fundamental properties such as confluence and preservation of β-strong normalisation. Secondly, we use λj to describe known notions of developments and superdevelopments, and introduce a more general one called XL-development. Then we show how to reformulate Regnier's σ-equivalence in λj so that it becomes a strong bisimulation. Finally, we prove that explicit composition or de-composition of substitutions can be added to λj while still preserving β-strong normalisation.

Original languageEnglish
Title of host publicationComputer Science Logic - 24th International Workshop, CSL 2010, and 19th Annual Conference of the EACSL, Proceedings
PublisherSpringer Verlag
Pages381-395
Number of pages15
ISBN (Print)364215204X, 9783642152047
DOIs
Publication statusPublished - 1 Jan 2010
Event24th International Workshop on Computer Science Logic, CSL 2010, and 19th Annual Conference of the EACSL - Brno, Czech Republic
Duration: 23 Aug 201027 Aug 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6247 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Workshop on Computer Science Logic, CSL 2010, and 19th Annual Conference of the EACSL
Country/TerritoryCzech Republic
CityBrno
Period23/08/1027/08/10

Fingerprint

Dive into the research topics of 'The structural λ-calculus'. Together they form a unique fingerprint.

Cite this