ISBN: 9783540657637 - typed lambda calculi and applications: 4th international conference, tlca'99, l'aquila, italy, april 7-9, 1999, proceedings (lecture notes in computer science, 1581, band 1581) (4 Ergebnisse)

23,5 x 15,5 cm. Zustand: Gut. 1. Auflage. VIII, 396 Seiten 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings. - Innen sehr sauberer, guter Zustand. Softcover, Broschur mit den üblichen Bibliotheks-Markierungen, Stempeln und Einträgen, innen wie außen, siehe Bilder. Einband mit sehr leichten Lagerspuren. DE-110-06 Sprache: Englisch Gewicht in Gramm: 620. …

1999th ed. 15 x 23 cm. 412 pages. Paperback. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Englisch.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…