Typed Lambda Calculi and Applications (eBook, PDF)

6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings
Redaktion: Hofmann, Martin

• Format: PDF

Produktbeschreibung

The refereed proceedings of the 6th International Conference on Typed Lambda Calculi and Applications, TLCA 2003, held in Valencia, Spain in June 2003.

The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The volume reports research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to the application of proof assistants.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 320
• Erscheinungstermin: 3. August 2003
• Englisch
• ISBN-13: 9783540449041
• Artikelnr.: 53150272

Autorenporträt

Prof. Dr. Martin Hofmann, lehrt an der Ludwig-Maximilians-Universität München, Institut für Informatik, Theoretische Informatik, Germany.

Inhaltsangabe

Termination and Productivity Checking with Continuous Types.- Derivatives of Containers.- Max-Plus Quasi-interpretations.- Inductive Types in the Calculus of Algebraic Constructions.- On Strong Normalization in the Intersection Type Discipline.- Relative Definability and Models of Unary PCF.- Principal Typing in Elementary Affine Logic.- A Logical Framework with Dependently Typed Records.- A Sound and Complete CPS-Translation for ??-Calculus.- Abstraction Barrier-Observing Relational Parametricity.- Encoding of the Halting Problem into the Monster Type and Applications.- Well-Going Programs Can Be Typed.- Parameterizations and Fixed-Point Operators on Control Categories.- Functional In-Place Update with Layered Datatype Sharing.- A Fully Abstract Bidomain Model of Unary FPC.- On a Semantic Definition of Data Independence.- Nondeterministic Light Logics and NP-Time.- Polarized Proof Nets with Cycles and Fixpoints Semantics.- Observational Equivalence and Program Extraction in the Coq Proof Assistant.- Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts.- A Universal Embedding for the Higher Order Structure of Computational Effects.