Cantitate/Preț
Produs

Typed Lambda Calculi and Applications: Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, April 10 - 12, 1995. Proceedings: Lecture Notes in Computer Science, cartea 902

Editat de Mariangiola Dezani-Ciancaglini, Gordon Plotkin
en Limba Engleză Paperback – 17 mar 1995
This volume presents the proceedings of the Second International Conference on Typed Lambda Calculi and Applications, held in Edinburgh, UK in April 1995.
The book contains 29 full revised papers selected from 58 submissions and comprehensively reports the state of the art in the field. The following topics are addressed: proof theory of type systems, logic and type systems, typed lambda calculi as models of (higher-order) computation, semantics of type systems, proof verification via type systems, type systems of programming languages, and typed term rewriting systems.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33365 lei

Preț vechi: 41706 lei
-20% Nou

Puncte Express: 500

Preț estimativ în valută:
6385 6633$ 5304£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540590484
ISBN-10: 354059048X
Pagini: 460
Ilustrații: VIII, 452 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.64 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Comparing ?-calculus translations in sharing graphs.- Extensions of pure type systems.- A model for formal parametric polymorphism: A per interpretation for system R.- A realization of the negative interpretation of the Axiom of Choice.- Using subtyping in program optimization.- What is a categorical model of Intuitionistic Linear Logic?.- An explicit Eta rewrite rule.- Extracting text from proofs.- Higher-order abstract syntax in Coq.- Expanding extensional polymorphism.- Lambda-calculus, combinators and the comprehension scheme.- ??-Equality for coproducts.- Typed operational semantics.- A simple calculus of exception handling.- A simple model for quotient types.- Untyped ?-calculus with relative typing.- Final semantics for untyped ?-calculus.- A simplification of Girard's paradox.- Basic properties of data types with inequational refinements.- Decidable properties of intersection type systems.- Termination proof of term rewriting system with the multiset path ordering. A complete development in the system Coq.- Typed ?-calculi with explicit substitutions may not terminate.- On equivalence classes of interpolation equations.- Strict functionals for termination proofs.- A verified typechecker.- Categorical semantics of the call-by-value ?-calculus.- A fully abstract translation between a ?-calculus with reference types and Standard ML.- Categorical completeness results for the simply-typed lambda-calculus.- Third-order matching in the presence of type constructors.