Typed lambda calculi and applications : 6th international conference, TLCA 2003, Valencia, Spain, June 10-12, 2003 : proceedings
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
2701 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Typed lambda calculi and applications, 6th international conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, proceedings, Martin Hofmann (ed.), Berlin, Springer, 2003, 1 vol. (VIII-315 p.), Lecture notes in computer science, 3-540-40332-9 • Typed Lambda Calculi and Applications, Texte imprimé, 9783662165799 |
Spis treści:
- 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.