Typed Lambda Calculi and Applications 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings /
Typed Lambda Calculi and Applications 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings / [electronic resource] :
edited by Martin Hofmann.
- 1st ed. 2003.
- VIII, 320 p. online resource.
- Lecture Notes in Computer Science, 2701 1611-3349 ; .
- Lecture Notes in Computer Science, 2701 .
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.
9783540449041
10.1007/3-540-44904-3 doi
Mathematical logic.
Machine theory.
Computer programming.
Compilers (Computer programs).
Computer science.
Mathematical Logic and Foundations.
Formal Languages and Automata Theory.
Programming Techniques.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
QA8.9-10.3
511.3
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.
9783540449041
10.1007/3-540-44904-3 doi
Mathematical logic.
Machine theory.
Computer programming.
Compilers (Computer programs).
Computer science.
Mathematical Logic and Foundations.
Formal Languages and Automata Theory.
Programming Techniques.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
QA8.9-10.3
511.3