Typed lambda calculi and applications : 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003 : proceedings
Author(s)
Bibliographic Information
Typed lambda calculi and applications : 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003 : proceedings
（Lecture notes in computer science, 2701）
Springer, c2003
Available at / 30 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||270103018505
-
INTERNATIONAL CHRISTIAN UNIVERSITY LIBRARY図
V.2701007.6/L507/v.270105957583,
007.6/L507/v.270105957583 -
University of Tsukuba Library, Library on Library and Information Science
007.08-L49-270110003304532
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
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.
by "Nielsen BookData"