Simona Ronchi Della Rocca
Proceedings of the Eighth International Conference on Typed Lambda Calculi and Applications
TLCA, 2007.

@proceedings{TLCA-2007,
	address       = "Paris, France",
	editor        = "Simona Ronchi Della Rocca",
	isbn          = "978-3-540-73227-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Eighth International Conference on Typed Lambda Calculi and Applications}",
	volume        = 4583,
	year          = 2007,
}

Contents (27 items)

5 ×#calculus
4 ×#type system
3 ×#higher-order
3 ×#linear
3 ×#logic
3 ×#normalisation
3 ×#semantics
2 ×#analysis
2 ×#continuation
2 ×#polynomial

TLCA-2007-Pfenning #logic #on the

On a Logical Foundation for Explicit Substitutions (FP), p. 1.

TLCA-2007-Baillot #linear #logic #polynomial #type system

From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing (PB), pp. 2–7.

TLCA-2007-Abel #induction #normalisation

Strong Normalization and Equi-(Co)Inductive Types (AA0), pp. 8–22.

TLCA-2007-Berardi #game studies #semantics

Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves (SB), pp. 23–38.

TLCA-2007-BlumO #λ-calculus

The Safe λ Calculus (WB, CHLO), pp. 39–53.

TLCA-2007-Boulme #calculus #refinement

Intuitionistic Refinement Calculus (SB), pp. 54–69.

TLCA-2007-BoveC

Computation by Prophecy (AB, VC), pp. 70–83.

TLCA-2007-DavidN #calculus #equation #normalisation #proving #recursion

An Arithmetical Proof of the Strong Normalization for the λ -Calculus with Recursive Equations on Types (RD, KN), pp. 84–101.

TLCA-2007-CousineauD #calculus #type system

Embedding Pure Type Systems in the λ-π-Calculus Modulo (DC, GD), pp. 102–117.

TLCA-2007-Santo

Completing Herbelin’s Programme (JES), pp. 118–132.

TLCA-2007-SantoMP #calculus #continuation #normalisation

Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi (JES, RM, LP), pp. 133–147.

TLCA-2007-FaggianP #linear #π-calculus

Ludics is a Model for the Finitary Linear π-Calculus (CF, MP), pp. 148–162.

TLCA-2007-Fiore #difference #linear #logic #modelling #multi

Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic (MPF), pp. 163–177.

TLCA-2007-IntrigilaS #calculus

The ω-Rule is Π¹₁-Complete in the λβ-Calculus (BI, RS), pp. 178–193.

TLCA-2007-JiangZ

Weakly Distributive Domains (YJ, GQZ), pp. 194–206.

TLCA-2007-JohannG #algebra #exclamation #semantics

Initial Algebra Semantics Is Enough! (PJ, NG), pp. 207–222.

TLCA-2007-KiselyovS #continuation #type system

A Substructural Type System for Delimited Continuations (OK, CcS), pp. 223–239.

TLCA-2007-Kusmierek #problem #rank

The Inhabitation Problem for Rank Two Intersection Types (DK), pp. 240–254.

TLCA-2007-Lindley

Extensional Rewriting with Sums (SL), pp. 255–271.

TLCA-2007-LiptonN #constraints #higher-order #logic programming #programming language #semantics

Higher-Order Logic Programming Languages with Constraints: A Semantics (JL, SN), pp. 272–289.

TLCA-2007-Marion #analysis

Predicative Analysis of Feasibility and Diagonalization (JYM), pp. 290–304.

TLCA-2007-Mazza #abstraction #combinator #interactive #symmetry

Edifices and Full Abstraction for the Symmetric Interaction Combinators (DM), pp. 305–320.

TLCA-2007-MostrousY #higher-order #mobile #process #type system

Two Session Typing Systems for Higher-Order Mobile Processes (DM, NY), pp. 321–335.

TLCA-2007-Nakazawa #morphism #proving #reduction

An Isomorphism Between Cut-Elimination Procedure and Proof Reduction (KN), pp. 336–350.

TLCA-2007-ShkaravskaKE #analysis #first-order #polynomial

Polynomial Size Analysis of First-Order Functions (OS, RvK, MCJDvE), pp. 351–365.

TLCA-2007-Tatsuta #higher-order #quantifier #set

Simple Saturated Sets for Disjunction and Second-Order Existential Quantification (MT), pp. 366–380.

TLCA-2007-Vaux #λ-calculus #μ-calculus

Convolution λμ-Calculus (LV), pp. 381–395.