KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Typed Lambda Calculi and Applications
  • Produktbild: Typed Lambda Calculi and Applications
Band 2044

Typed Lambda Calculi and Applications 5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

20.04.2001

Abbildungen

XII, 436 p.

Herausgeber

Samson Abramsky

Verlag

Springer Berlin

Seitenzahl

436

Maße (L/B/H)

23,5/15,5/2,5 cm

Gewicht

674 g

Auflage

2001

Sprache

Englisch

ISBN

978-3-540-41960-0

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

20.04.2001

Abbildungen

XII, 436 p.

Herausgeber

Samson Abramsky

Verlag

Springer Berlin

Seitenzahl

436

Maße (L/B/H)

23,5/15,5/2,5 cm

Gewicht

674 g

Auflage

2001

Sprache

Englisch

ISBN

978-3-540-41960-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Typed Lambda Calculi and Applications
  • Produktbild: Typed Lambda Calculi and Applications
  • 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.- ParallelImplementation 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.