Typed Lambda Calculi and Applications : 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings / / edited by Martin Hofmann
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Typed Lambda Calculi and Applications : 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings / / edited by Martin Hofmann
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Edizione: | 1st ed. 2003. |
| Descrizione fisica: | 1 online resource (VIII, 320 p.) |
| Disciplina: | 511.3 |
| Soggetto topico: | Mathematical logic |
| Computer programming | |
| Programming languages (Electronic computers) | |
| Computer logic | |
| Mathematical Logic and Foundations | |
| Mathematical Logic and Formal Languages | |
| Programming Techniques | |
| Programming Languages, Compilers, Interpreters | |
| Logics and Meanings of Programs | |
| Persona (resp. second.): | HofmannMartin |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | 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. |
| Titolo autorizzato: | Typed Lambda Calculi and Applications |
| ISBN: | 3-540-44904-3 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910768472203321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Computer Science, . 0302-9743 ; ; 2701