Typed Lambda Calculi and Applications 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings /
Typed Lambda Calculi and Applications 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings / [electronic resource] :
edited by Jean-Yves Girard.
- 1st ed. 1999.
- VIII, 404 p. online resource.
- Lecture Notes in Computer Science, 1581 1611-3349 ; .
- Lecture Notes in Computer Science, 1581 .
Invited Demonstration -- The Coordination Language Facility and Applications -- AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem -- Contributions -- Modules in Non-commutative Logic -- Elementary Complexity and Geometry of Interaction -- Quantitative Semantics Revisited -- Total Functionals and Well-Founded Strategies -- Counting a Type’s Principal Inhabitants -- Useless-Code Detection and Elimination for PCF with Algebraic Data Types -- Every Unsolvable ? Term has a Decoration -- Game Semantics for Untyped ???-Calculus -- A Finite Axiomatization of Inductive-Recursive Definitions -- Lambda Definability with Sums via Grothendieck Logical Relations -- Explicitly Typed ??-Calculus for Polymorphism and Call-by-Value -- Soundness of the Logical Framework for Its Typed Operational Semantic -- Logical Predicates for Intuitionistic Linear Type Theories -- Polarized Proof-Nets: Proof-Nets for LC -- Call-by-Push-Value: A Subsuming Paradigm -- A Study of Abramsky’s Linear Chemical Abstract Machine -- Resource Interpretations, Bunched Implications and the ??-Calculus (Preliminary Version) -- A Curry-Howard Isomorphism for Compilation and Program Execution -- Natural Deduction for Intuitionistic Non-commutative Linear Logic -- A Logic for Abstract Data Types as Existential Types -- Characterising Explicit Substitutions which Preserve Termination -- Explicit Environments -- Consequences of Jacopini’s Theorem: Consistent Equalities and Equations -- Strong Normalisation of Cut-Elimination in Classical Logic -- Pure Type Systems with Subtyping.
9783540489597
10.1007/3-540-48959-2 doi
Computer science.
Machine theory.
Computer programming.
Mathematical logic.
Theory of Computation.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Programming Techniques.
Mathematical Logic and Foundations.
QA75.5-76.95
004.0151
Invited Demonstration -- The Coordination Language Facility and Applications -- AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem -- Contributions -- Modules in Non-commutative Logic -- Elementary Complexity and Geometry of Interaction -- Quantitative Semantics Revisited -- Total Functionals and Well-Founded Strategies -- Counting a Type’s Principal Inhabitants -- Useless-Code Detection and Elimination for PCF with Algebraic Data Types -- Every Unsolvable ? Term has a Decoration -- Game Semantics for Untyped ???-Calculus -- A Finite Axiomatization of Inductive-Recursive Definitions -- Lambda Definability with Sums via Grothendieck Logical Relations -- Explicitly Typed ??-Calculus for Polymorphism and Call-by-Value -- Soundness of the Logical Framework for Its Typed Operational Semantic -- Logical Predicates for Intuitionistic Linear Type Theories -- Polarized Proof-Nets: Proof-Nets for LC -- Call-by-Push-Value: A Subsuming Paradigm -- A Study of Abramsky’s Linear Chemical Abstract Machine -- Resource Interpretations, Bunched Implications and the ??-Calculus (Preliminary Version) -- A Curry-Howard Isomorphism for Compilation and Program Execution -- Natural Deduction for Intuitionistic Non-commutative Linear Logic -- A Logic for Abstract Data Types as Existential Types -- Characterising Explicit Substitutions which Preserve Termination -- Explicit Environments -- Consequences of Jacopini’s Theorem: Consistent Equalities and Equations -- Strong Normalisation of Cut-Elimination in Classical Logic -- Pure Type Systems with Subtyping.
9783540489597
10.1007/3-540-48959-2 doi
Computer science.
Machine theory.
Computer programming.
Mathematical logic.
Theory of Computation.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Programming Techniques.
Mathematical Logic and Foundations.
QA75.5-76.95
004.0151