Typed Lambda Calculi and Applications - neues Buch

EAN (ISBN-13): 9783540454137
Erscheinungsjahr: 2001
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-25T08:28:33+02:00 (Berlin)
Detailseite zuletzt geändert am 2021-12-16T16:50:39+01:00 (Berlin)
ISBN/EAN: 9783540454137

ISBN - alternative Schreibweisen:
978-3-540-45413-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: abramsky

---

Daten vom Verlag:

Autor/in: Samson Abramsky
Titel: Lecture Notes in Computer Science; Typed Lambda Calculi and Applications - 5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings
Verlag: Springer; Springer Berlin
436 Seiten
Erscheinungsjahr: 2003-06-29
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XII, 436 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Analysis; Mathematische Analysis, allgemein; Verstehen; categorical methods; computational logic; deduction; lambda calculi; lambda calculus; logic; logical relations; program logics; program semantics; programming theory; type systems; typed lambda calculi; C; Analysis; Mathematical Logic and Foundations; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Programming Techniques; Compilers and Interpreters; Computer Science; Mathematik: Logik; Mathematische Grundlagen; Theoretische Informatik; Computerprogrammierung und Softwareentwicklung; Compiler und Übersetzer; BC

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.
Includes supplementary material: sn.pub/extras