Typed Lambda Calculi and Applications
Editat de Mariangiola Dezani-Ciancaglini, Gordon Plotkinen Limba Engleză Paperback – 17 mar 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.
Preț: 330.36 lei
Preț vechi: 412.95 lei
-20%
Puncte Express: 496
Carte tipărită la comandă
Livrare economică 07-21 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540590484
ISBN-10: 354059048X
Pagini: 460
Ilustrații: VIII, 452 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354059048X
Pagini: 460
Ilustrații: VIII, 452 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
-20%Preț: 802.41 lei1003.01 lei -
Computer Vision: Models, Learning, and InferenceSimon J. D. Prince-20%Preț: 561.50 lei701.88 lei -
Enterprise Content and Search Management for Building Digital PlatformsShailesh Kumar Shivakumar-20%Preț: 493.61 lei617.00 lei -
Programming MethodologyDavid Gries-20%Preț: 330.61 lei413.26 lei -
Spock: Up and RunningRob Fletcher-20%Preț: 340.43 lei425.53 lei -
Tragic DesignJonathan Shariat-20%Preț: 181.81 lei227.26 lei -
Thoughtful Machine Learning with PythonMatthew Kirk-20%Preț: 244.61 lei305.76 lei -
This is Service Design DoingMarc Stickdorn-20%Preț: 246.08 lei307.59 lei -
Karau, H: High Performance SparkHolden Karau-20%Preț: 233.24 lei291.55 lei -
Practical TableauRyan Sleeper-20%Preț: 314.11 lei392.64 lei -
A Course in Mathematical CryptographyGilbert Baumslag-20%Preț: 323.07 lei403.83 lei -
-20%Preț: 363.26 lei454.07 lei -
Transactions on Computational Systems Biology VIGordon Plotkin-20%Preț: 318.00 lei397.50 lei -
Automata, Languages and ProgrammingGiorgio Ausiello-20%Preț: 649.68 lei812.11 lei -
Formal Methods: Foundations and ApplicationsJuliano Iyoda-20%Preț: 292.49 lei365.61 lei -
Constraint Solving and Language ProcessingDenys Duchier-20%Preț: 289.19 lei361.48 lei -
-20%Preț: 314.22 lei392.77 lei -
Agentenbasierte SchwarmintelligenzTjorben Bogon-20%Preț: 372.66 lei465.82 lei -
Matrices and Simplex AlgorithmsAaart R. Heesterman-20%Preț: 350.83 lei438.54 lei -
Industrial Application of Electromagnetic Computer CodesYves R. CrutzenPreț: 375.08 lei
Public țintă
ResearchCuprins
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.