Rewriting and Typed Lambda Calculi
Springer International Publishing (Verlag)
978-3-319-08917-1 (ISBN)
Gilles Dowek is Director of Research at INRIA and heads the LOGICAL project-team. He is also a Professor at the École Polytechnique and a researcher at the École Polytechnique's Computer Science Laboratory (LIX). He is an advisor to the National Institute of Aerospace, a NASA Langley research centre laboratory. His research focuses on formalising mathematics, on demonstration processing systems related to quantum programming language design and on safety for aerospace systems. He has written several works aimed at explaining maths and science theory in layman's terms.
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.
| Erscheint lt. Verlag | 15.7.2014 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XXII, 491 p. 58 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 783 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Schlagworte | Automata • complexity analysis • constraint and logic programming • Constructive Mathematics • equational logic and rewriting • higher order logic and rewriting • Lambda Calculus • lambda-mu calculus • Logic • Model Checking • Pattern Matching • Proof theory • Type Theory |
| ISBN-10 | 3-319-08917-X / 331908917X |
| ISBN-13 | 978-3-319-08917-1 / 9783319089171 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
