Typed Lambda Calculi and Applications [electronic resource] : 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings /

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.

Saved in:
Bibliographic Details
Main Authors: Girard, Jean-Yves. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999
Subjects:Computer science., Computer programming., Computers., Computer logic., Mathematical logic., Computer Science., Theory of Computation., Mathematical Logic and Formal Languages., Logics and Meanings of Programs., Programming Techniques., Mathematical Logic and Foundations.,
Online Access:http://dx.doi.org/10.1007/3-540-48959-2
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:206915
record_format koha
spelling KOHA-OAI-TEST:2069152018-07-30T23:36:42ZTyped Lambda Calculi and Applications [electronic resource] : 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings / Girard, Jean-Yves. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1999.engInvited 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.Computer science.Computer programming.Computers.Computer logic.Mathematical logic.Computer Science.Theory of Computation.Mathematical Logic and Formal Languages.Logics and Meanings of Programs.Programming Techniques.Mathematical Logic and Foundations.Springer eBookshttp://dx.doi.org/10.1007/3-540-48959-2URN:ISBN:9783540489597
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Computer science.
Computer programming.
Computers.
Computer logic.
Mathematical logic.
Computer Science.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Programming Techniques.
Mathematical Logic and Foundations.
Computer science.
Computer programming.
Computers.
Computer logic.
Mathematical logic.
Computer Science.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Programming Techniques.
Mathematical Logic and Foundations.
spellingShingle Computer science.
Computer programming.
Computers.
Computer logic.
Mathematical logic.
Computer Science.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Programming Techniques.
Mathematical Logic and Foundations.
Computer science.
Computer programming.
Computers.
Computer logic.
Mathematical logic.
Computer Science.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Programming Techniques.
Mathematical Logic and Foundations.
Girard, Jean-Yves. editor.
SpringerLink (Online service)
Typed Lambda Calculi and Applications [electronic resource] : 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings /
description 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.
format Texto
topic_facet Computer science.
Computer programming.
Computers.
Computer logic.
Mathematical logic.
Computer Science.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Programming Techniques.
Mathematical Logic and Foundations.
author Girard, Jean-Yves. editor.
SpringerLink (Online service)
author_facet Girard, Jean-Yves. editor.
SpringerLink (Online service)
author_sort Girard, Jean-Yves. editor.
title Typed Lambda Calculi and Applications [electronic resource] : 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings /
title_short Typed Lambda Calculi and Applications [electronic resource] : 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings /
title_full Typed Lambda Calculi and Applications [electronic resource] : 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings /
title_fullStr Typed Lambda Calculi and Applications [electronic resource] : 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings /
title_full_unstemmed Typed Lambda Calculi and Applications [electronic resource] : 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings /
title_sort typed lambda calculi and applications [electronic resource] : 4th international conference, tlca’99 l’aquila, italy, april 7–9, 1999 proceedings /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg,
publishDate 1999
url http://dx.doi.org/10.1007/3-540-48959-2
work_keys_str_mv AT girardjeanyveseditor typedlambdacalculiandapplicationselectronicresource4thinternationalconferencetlca99laquilaitalyapril791999proceedings
AT springerlinkonlineservice typedlambdacalculiandapplicationselectronicresource4thinternationalconferencetlca99laquilaitalyapril791999proceedings
_version_ 1756268313745293312