Martin Hofmann 0001
Proceedings of the Sixth International Conference on Typed Lambda Calculi and Applications
TLCA, 2003.

@proceedings{TLCA-2003,
	address       = "Valencia, Spain",
	editor        = "Martin Hofmann 0001",
	isbn          = "3-540-40332-9",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Sixth International Conference on Typed Lambda Calculi and Applications}",
	volume        = 2701,
	year          = 2003,
}

Contents (21 items)

3 ×#logic
2 ×#calculus
2 ×#fixpoint
2 ×#on the
2 ×#proving
2 ×#semantics

TLCA-2003-Abel #termination

Termination and Productivity Checking with Continuous Types (AA0), pp. 1–15.

TLCA-2003-AbbottAGM

Derivatives of Containers (MA, TA, NG, CM), pp. 16–30.

TLCA-2003-Amadio

Max-Plus Quasi-interpretations (RMA), pp. 31–45.

TLCA-2003-Blanqui #algebra #calculus #induction

Inductive Types in the Calculus of Algebraic Constructions (FB), pp. 46–59.

TLCA-2003-Boudol #normalisation #on the

On Strong Normalization in the Intersection Type Discipline (GB), pp. 60–74.

TLCA-2003-BucciarelliLP #modelling

Relative Definability and Models of Unary PCF (AB, BL, VP), pp. 75–89.

TLCA-2003-CoppolaR #logic #type system

Principal Typing in Elementary Affine Logic (PC, SRDR), pp. 90–104.

TLCA-2003-CoquandPT #framework #logic

A Logical Framework with Dependently Typed Records (TC, RP, MT), pp. 105–119.

TLCA-2003-Fujita #λ-calculus #μ-calculus

A Sound and Complete CPS-Translation for λμ-Calculus (KeF), pp. 120–134.

TLCA-2003-Hannay #abstraction #parametricity #relational

Abstraction Barrier-Observing Relational Parametricity (JEH), pp. 135–152.

TLCA-2003-Joly #encoding #problem

Encoding of the Halting Problem into the Monster Type & Applications (TJ), pp. 153–166.

TLCA-2003-Kahrs #source code

Well-Going Programs Can Be Typed (SK), pp. 167–179.

TLCA-2003-KakutaniH #category theory #fixpoint

Parameterizations and Fixed-Point Operators on Control Categories (YK, MH), pp. 180–194.

TLCA-2003-Konecny #data type #functional

Functional In-Place Update with Layered Datatype Sharing (MK), pp. 195–210.

TLCA-2003-Laird #domain model

A Fully Abstract Bidomain Model of Unary FPC (JL), pp. 211–225.

TLCA-2003-LazicN #independence #on the #semantics

On a Semantic Definition of Data Independence (RL, DN), pp. 226–240.

TLCA-2003-Maurel #logic #nondeterminism

Nondeterministic Light Logics and NP-Time (FM), pp. 241–255.

TLCA-2003-Montelatici #fixpoint #proving #semantics

Polarized Proof Nets with Cycles and Fixpoints Semantics (RM), pp. 256–270.

TLCA-2003-Oury #coq #equivalence #proving

Observational Equivalence and Program Extraction in the Coq Proof Assistant (NO), pp. 271–285.

TLCA-2003-SantoP #calculus #multi

Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts (JES, LP), pp. 286–300.

TLCA-2003-Power #higher-order

A Universal Embedding for the Higher Order Structure of Computational Effects (JP), pp. 301–315.