Cantitate/Preț
Produs
Total produse
Vezi coșul
Rewriting and Typed Lambda Calculi: Joint International Conferences, RTA and TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings de Gilles Dowek

Rewriting and Typed Lambda Calculi: Joint International Conferences, RTA and TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8560

Editat de Gilles Dowek
en Limba Engleză Paperback – 15 iul 2014
This book constitutes the refereed proceedings of the Joint 25th International Conference on Rewriting Techniques and Applications, RTA 2014, and 12th International Conference on Typed Lambda-Calculi and Applications, TLCA 2014, held as part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. The 28 revised full papers and 3 short papers presented were carefully reviewed and selected from 87 submissions. The papers provide research results on all aspects of rewriting and typed lambda calculi, ranging from theoretical and methodological issues to applications in various contexts. They address a wide variety of topics such as algorithmic aspects, implementation, logic, types, semantics, and programming.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34329 lei

Preț vechi: 42911 lei
-20% Nou

Puncte Express: 515
Preț estimativ în valută:
6569€ • 6787$ • 5465£

Carte tipărită la comandă

Livrare economică 20 martie-03 aprilie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319089171
ISBN-10: 331908917X
Pagini: 513
Ilustrații: XXII, 491 p. 58 illus.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.72 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Process Types as a Descriptive Tool for Interaction: Control and the Pi-Calculus.- Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk).- Unnesting of Copatterns.- Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams.- Predicate Abstraction of Rewrite Theories.- Unification and Logarithmic Space.- Ramsey Theorem as an Intuitionistic Property of Well Founded Relations.- A Model of Countable Nondeterminism in Guarded Type Theory.- Cut Admissibility by Saturation.- Automatic Evaluation of Context-Free Grammars (System Description).- Tree Automata with Height Constraints between Brothers.- A Coinductive Confluence Proof for Infinitary Lambda-Calculus.- An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting.- Preciseness of Subtyping on Intersection and Union Types.- Abstract Datatypes for Real Numbers in Type Theory.- Self Types for Dependently Typed Lambda Encodings.- First-Order Formative Rules.- Automated Complexity Analysis Based on Context-Sensitive Rewriting.- Amortised Resource Analysis and Typed Polynomial Interpretations.- Confluence by Critical Pair Analysis.- Proof Terms for Infinitary Rewriting.- Construction of Retractile Proof Structures.- Local States in String Diagrams.- Reduction System for Extensional Lambda-mu Calculus.- The Structural Theory of Pure Type Systems.- Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB.- Implicational Relevance Logic is 2-ExpTime-Complete.- Near Semi-rings and Lambda Calculus.- All-Path Reachability Logic.- Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs.- Conditional Confluence (System Description).- Nagoya Termination Tool.- Termination of Cycle Rewriting.