The Resource Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings
Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings
Resource Information
The item Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
- Summary
- This book constitutes the refereed proceedings of the 5th International Conference on Typed Lambda Calculi and Applications, TLCA 2001, held in Krakow, Poland in May 2001. The 28 revised full papers presented were carefully reviewed and selected from 55 submissions. The volume reports research results on all current aspects of typed lambda calculi. Among the topics addressed are type systems, subtypes, coalgebraic methods, pi-calculus, recursive games, various types of lambda calculi, reductions, substitutions, normalization, linear logic, cut-elimination, prelogical relations, and mu calculus
- Language
- eng
- Extent
- 1 online resource.
- Contents
-
- Invited Lectures
- Many Happy Re urns
- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour
- Definability of Total Objects in PCF and Related Calculi
- Categorical Semantics of Control
- Contributed Papers
- Representations of First Order Function Types as Terminal Coalgebras
- A Finitary Subsystem of the Polymorphic?-Calculus
- Sequentiality and the?-Calculus
- Logical Properites of Name Restriction
- Subtyping Recursive Games
- Typing Lambda Terms in Elementary Logic with Linear Constraints
- Ramied Recurrence with Dependent Types
- Game Semantics for the Pure Lazy?-Calculus
- Reductions, intersection types, and explicit substitutions
- The Stratified Foundations as a Theory Modulo
- Normalization by Evaluation for the Computational Lambda-Calculus
- Induction Is Not Derivable in Second Order Dependent Type Theory
- Strong Normalization of Classical Natural Deduction with Disjunction
- Partially Additive Categories and Fully Complete Models of Linear Logic
- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types
- The Finitely Generated Types of the?-Calculus
- Deciding Monadic Theories of Hyperalgebraic Trees
- A Deconstruction of Non-deterministic Classical Cut Elimination
- A Token Machine for Full Geometry of Interaction (Extended Abstract)
- Second-Order Pre-logical Relations and Representation Independence
- Characterizing Convergent Terms in Object Calculi via Intersection Types
- Parigot's Second Order??-Calculus and Inductive Types
- The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping
- Evolving Games and Essential Nets for Affine Polymorphism
- Retracts in Simple Types
- Parallel Implementation Models for the?-Calculus Using the Geometry of Interaction (Extended Abstract)
- The complexity of?-reduction in low orders
- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
- Isbn
- 9783540454137
- Label
- Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings
- Title
- Typed Lambda Calculi and Applications
- Title remainder
- 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings
- Subject
-
- Computer science
- Logic design
- Logic design
- Logic, Symbolic and mathematical
- Logic, Symbolic and mathematical
- Logics and Meanings of Programs
- Mathematical Logic and Formal Languages
- Mathematical Logic and Foundations
- Programming Languages, Compilers, Interpreters
- Programming Techniques
- Computer science
- Language
- eng
- Summary
- This book constitutes the refereed proceedings of the 5th International Conference on Typed Lambda Calculi and Applications, TLCA 2001, held in Krakow, Poland in May 2001. The 28 revised full papers presented were carefully reviewed and selected from 55 submissions. The volume reports research results on all current aspects of typed lambda calculi. Among the topics addressed are type systems, subtypes, coalgebraic methods, pi-calculus, recursive games, various types of lambda calculi, reductions, substitutions, normalization, linear logic, cut-elimination, prelogical relations, and mu calculus
- Cataloging source
- DKDLA
- http://library.link/vocab/creatorDate
- 1953-
- http://library.link/vocab/creatorName
- Abramsky, Samson
- Dewey number
- 005.131
- Index
- no index present
- LC call number
- QA8.9-QA10.3
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- standards specifications
- Series statement
- Lecture Notes in Computer Science
- Series volume
- 2044,
- http://library.link/vocab/subjectName
-
- Computer science
- Logic design
- Logic, Symbolic and mathematical
- Mathematical Logic and Formal Languages
- Logics and Meanings of Programs
- Programming Techniques
- Programming Languages, Compilers, Interpreters
- Mathematical Logic and Foundations
- Computer science
- Logic design
- Logic, Symbolic and mathematical
- Label
- Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Invited Lectures -- Many Happy Re urns -- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour -- Definability of Total Objects in PCF and Related Calculi -- Categorical Semantics of Control -- Contributed Papers -- Representations of First Order Function Types as Terminal Coalgebras -- A Finitary Subsystem of the Polymorphic?-Calculus -- Sequentiality and the?-Calculus -- Logical Properites of Name Restriction -- Subtyping Recursive Games -- Typing Lambda Terms in Elementary Logic with Linear Constraints -- Ramied Recurrence with Dependent Types -- Game Semantics for the Pure Lazy?-Calculus -- Reductions, intersection types, and explicit substitutions -- The Stratified Foundations as a Theory Modulo -- Normalization by Evaluation for the Computational Lambda-Calculus -- Induction Is Not Derivable in Second Order Dependent Type Theory -- Strong Normalization of Classical Natural Deduction with Disjunction -- Partially Additive Categories and Fully Complete Models of Linear Logic -- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types -- The Finitely Generated Types of the?-Calculus -- Deciding Monadic Theories of Hyperalgebraic Trees -- A Deconstruction of Non-deterministic Classical Cut Elimination -- A Token Machine for Full Geometry of Interaction (Extended Abstract) -- Second-Order Pre-logical Relations and Representation Independence -- Characterizing Convergent Terms in Object Calculi via Intersection Types -- Parigot's Second Order??-Calculus and Inductive Types -- The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping -- Evolving Games and Essential Nets for Affine Polymorphism -- Retracts in Simple Types -- Parallel Implementation Models for the?-Calculus Using the Geometry of Interaction (Extended Abstract) -- The complexity of?-reduction in low orders -- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
- Control code
- 769772898
- Extent
- 1 online resource.
- Form of item
- online
- Isbn
- 9783540454137
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/3-540-45413-6
- Specific material designation
- remote
- System control number
- (OCoLC)769772898
- Label
- Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Invited Lectures -- Many Happy Re urns -- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour -- Definability of Total Objects in PCF and Related Calculi -- Categorical Semantics of Control -- Contributed Papers -- Representations of First Order Function Types as Terminal Coalgebras -- A Finitary Subsystem of the Polymorphic?-Calculus -- Sequentiality and the?-Calculus -- Logical Properites of Name Restriction -- Subtyping Recursive Games -- Typing Lambda Terms in Elementary Logic with Linear Constraints -- Ramied Recurrence with Dependent Types -- Game Semantics for the Pure Lazy?-Calculus -- Reductions, intersection types, and explicit substitutions -- The Stratified Foundations as a Theory Modulo -- Normalization by Evaluation for the Computational Lambda-Calculus -- Induction Is Not Derivable in Second Order Dependent Type Theory -- Strong Normalization of Classical Natural Deduction with Disjunction -- Partially Additive Categories and Fully Complete Models of Linear Logic -- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types -- The Finitely Generated Types of the?-Calculus -- Deciding Monadic Theories of Hyperalgebraic Trees -- A Deconstruction of Non-deterministic Classical Cut Elimination -- A Token Machine for Full Geometry of Interaction (Extended Abstract) -- Second-Order Pre-logical Relations and Representation Independence -- Characterizing Convergent Terms in Object Calculi via Intersection Types -- Parigot's Second Order??-Calculus and Inductive Types -- The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping -- Evolving Games and Essential Nets for Affine Polymorphism -- Retracts in Simple Types -- Parallel Implementation Models for the?-Calculus Using the Geometry of Interaction (Extended Abstract) -- The complexity of?-reduction in low orders -- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
- Control code
- 769772898
- Extent
- 1 online resource.
- Form of item
- online
- Isbn
- 9783540454137
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/3-540-45413-6
- Specific material designation
- remote
- System control number
- (OCoLC)769772898
Subject
- Computer science
- Logic design
- Logic design
- Logic, Symbolic and mathematical
- Logic, Symbolic and mathematical
- Logics and Meanings of Programs
- Mathematical Logic and Formal Languages
- Mathematical Logic and Foundations
- Programming Languages, Compilers, Interpreters
- Programming Techniques
- Computer science
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Typed-Lambda-Calculi-and-Applications--5th/jAFzWhbx5NM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Typed-Lambda-Calculi-and-Applications--5th/jAFzWhbx5NM/">Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Typed-Lambda-Calculi-and-Applications--5th/jAFzWhbx5NM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Typed-Lambda-Calculi-and-Applications--5th/jAFzWhbx5NM/">Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Kraków, Poland, May 2 5, 2001 Proceedings</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
