Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automated deduction - CADE-21 : 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007 : proceedings / / Frank Pfenning
| Automated deduction - CADE-21 : 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007 : proceedings / / Frank Pfenning |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (XII, 524 p.) |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science,Lecture notes in artificial intelligence |
| Soggetto topico |
Automatic theorem proving
Logic, Symbolic and mathematical |
| ISBN | 3-540-73595-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1. Invited Talk: Colin Stirling -- Games, Automata and Matching -- Session 2. Higher-Order Logic -- Formalization of Continuous Probability Distributions -- Compilation as Rewriting in Higher Order Logic -- Barendregt’s Variable Convention in Rule Inductions -- Automating Elementary Number-Theoretic Proofs Using Gröbner Bases -- Session 3. Description Logic -- Optimized Reasoning in Description Logics Using Hypertableaux -- Conservative Extensions in the Lightweight Description Logic -- An Incremental Technique for Automata-Based Decision Procedures -- Session 4. Intuitionistic Logic -- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4 -- A Labelled System for IPL with Variable Splitting -- Session 5. Invited Talk: Ashish Tiwari -- Logical Interpretation: Static Program Analysis Using Theorem Proving -- Session 6. Satisfiability Modulo Theories -- Solving Quantified Verification Conditions Using Satisfiability Modulo Theories -- Efficient E-Matching for SMT Solvers -- -Decision by Decomposition -- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic -- Session 7. Induction, Rewriting, and Polymorphism -- Improvements in Formula Generalization -- On the Normalization and Unique Normalization Properties of Term Rewrite Systems -- Handling Polymorphism in Automated Deduction -- Session 8. First-Order Logic -- Automated Reasoning in Kleene Algebra -- SRASS - A Semantic Relevance Axiom Selection System -- Labelled Clauses -- Automatic Decidability and Combinability Revisited -- Session 9. Invited Talk: K. Rustan M. Leino -- Designing Verification Conditions for Software -- Session 10. Model Checking and Verification -- Encodings of Bounded LTL Model Checking in Effectively Propositional Logic -- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems -- The KeY system 1.0 (Deduction Component) -- KeY-C: A Tool for Verification of C Programs -- The Bedwyr System for Model Checking over Syntactic Expressions -- System for Automated Deduction (SAD): A Tool for Proof Verification -- Session 11. Invited Talk: Peter Baumgartner -- Logical Engineering with Instance-Based Methods -- Session 12. Termination -- Predictive Labeling with Dependency Pairs Using SAT -- Dependency Pairs for Rewriting with Non-free Constructors -- Proving Termination by Bounded Increase -- Certified Size-Change Termination -- Session 13. Tableaux and First-Order Systems -- Encoding First Order Proofs in SAT -- Hyper Tableaux with Equality -- System Description: E- KRHyper -- System Description: Spass Version 3.0. |
| Record Nr. | UNINA-9910484284303321 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated deduction - CADE-21 : 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007 : proceedings / / Frank Pfenning
| Automated deduction - CADE-21 : 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007 : proceedings / / Frank Pfenning |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (XII, 524 p.) |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science,Lecture notes in artificial intelligence |
| Soggetto topico |
Automatic theorem proving
Logic, Symbolic and mathematical |
| ISBN | 3-540-73595-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1. Invited Talk: Colin Stirling -- Games, Automata and Matching -- Session 2. Higher-Order Logic -- Formalization of Continuous Probability Distributions -- Compilation as Rewriting in Higher Order Logic -- Barendregt’s Variable Convention in Rule Inductions -- Automating Elementary Number-Theoretic Proofs Using Gröbner Bases -- Session 3. Description Logic -- Optimized Reasoning in Description Logics Using Hypertableaux -- Conservative Extensions in the Lightweight Description Logic -- An Incremental Technique for Automata-Based Decision Procedures -- Session 4. Intuitionistic Logic -- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4 -- A Labelled System for IPL with Variable Splitting -- Session 5. Invited Talk: Ashish Tiwari -- Logical Interpretation: Static Program Analysis Using Theorem Proving -- Session 6. Satisfiability Modulo Theories -- Solving Quantified Verification Conditions Using Satisfiability Modulo Theories -- Efficient E-Matching for SMT Solvers -- -Decision by Decomposition -- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic -- Session 7. Induction, Rewriting, and Polymorphism -- Improvements in Formula Generalization -- On the Normalization and Unique Normalization Properties of Term Rewrite Systems -- Handling Polymorphism in Automated Deduction -- Session 8. First-Order Logic -- Automated Reasoning in Kleene Algebra -- SRASS - A Semantic Relevance Axiom Selection System -- Labelled Clauses -- Automatic Decidability and Combinability Revisited -- Session 9. Invited Talk: K. Rustan M. Leino -- Designing Verification Conditions for Software -- Session 10. Model Checking and Verification -- Encodings of Bounded LTL Model Checking in Effectively Propositional Logic -- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems -- The KeY system 1.0 (Deduction Component) -- KeY-C: A Tool for Verification of C Programs -- The Bedwyr System for Model Checking over Syntactic Expressions -- System for Automated Deduction (SAD): A Tool for Proof Verification -- Session 11. Invited Talk: Peter Baumgartner -- Logical Engineering with Instance-Based Methods -- Session 12. Termination -- Predictive Labeling with Dependency Pairs Using SAT -- Dependency Pairs for Rewriting with Non-free Constructors -- Proving Termination by Bounded Increase -- Certified Size-Change Termination -- Session 13. Tableaux and First-Order Systems -- Encoding First Order Proofs in SAT -- Hyper Tableaux with Equality -- System Description: E- KRHyper -- System Description: Spass Version 3.0. |
| Record Nr. | UNISA-996465915403316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures [[electronic resource] ] : 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013, Proceedings / / edited by Frank Pfenning
| Foundations of Software Science and Computation Structures [[electronic resource] ] : 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013, Proceedings / / edited by Frank Pfenning |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXIV, 451 p. 51 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Compilers (Computer programs) Software engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Software Engineering Theory of Computation |
| ISBN | 3-642-37075-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Pattern Graphs and Rule-Based Models: The Semantics of Kappa -- History-Register Automata -- Fatal Attractors in Parity Games -- On Unique Decomposition of Processes in the Applied π-Calculus -- Bounded Context-Switching and Reentrant Locking -- Reachability of Communicating Timed Processes -- Modular Bisimulation Theory for Computations and Values -- Checking Bisimilarity for Attributed Graph Transformation -- Comodels and Effects in Mathematical Operational Semantics -- Preorders on Monads and Coalgebraic Simulations -- A Proof System for Compositional Verification of Probabilistic Concurrent Processes -- Partiality and Recursion in Higher-Order Logic -- Some Sahlqvist Completeness Results for Coalgebraic Logics -- Cut Elimination in Nested Sequents for Intuitionistic Modal Logics -- On Monadic Parametricity of Second-Order Functionals -- Deconstructing General References via Game Semantics -- Separation Logic for Non-local Control Flow and Block Scope Variables -- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems -- Deciding Definability by Deterministic Regular Expressions -- Type-Based Complexity Analysis for Fork Processes -- Pure Pointer Programs and Tree Isomorphism -- A Language for Differentiable Functions -- Computing Quantiles in Markov Reward Models -- Parameterized Weighted Containment -- Weighted Specifications over Nested Words -- An Algebraic Presentation of Predicate Logic -- Strategies as Profunctors -- Generalised Name Abstraction for Nominal Sets. |
| Record Nr. | UNISA-996465685103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures [[electronic resource] ] : 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013, Proceedings / / edited by Frank Pfenning
| Foundations of Software Science and Computation Structures [[electronic resource] ] : 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013, Proceedings / / edited by Frank Pfenning |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXIV, 451 p. 51 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Compilers (Computer programs) Software engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Software Engineering Theory of Computation |
| ISBN | 3-642-37075-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Pattern Graphs and Rule-Based Models: The Semantics of Kappa -- History-Register Automata -- Fatal Attractors in Parity Games -- On Unique Decomposition of Processes in the Applied π-Calculus -- Bounded Context-Switching and Reentrant Locking -- Reachability of Communicating Timed Processes -- Modular Bisimulation Theory for Computations and Values -- Checking Bisimilarity for Attributed Graph Transformation -- Comodels and Effects in Mathematical Operational Semantics -- Preorders on Monads and Coalgebraic Simulations -- A Proof System for Compositional Verification of Probabilistic Concurrent Processes -- Partiality and Recursion in Higher-Order Logic -- Some Sahlqvist Completeness Results for Coalgebraic Logics -- Cut Elimination in Nested Sequents for Intuitionistic Modal Logics -- On Monadic Parametricity of Second-Order Functionals -- Deconstructing General References via Game Semantics -- Separation Logic for Non-local Control Flow and Block Scope Variables -- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems -- Deciding Definability by Deterministic Regular Expressions -- Type-Based Complexity Analysis for Fork Processes -- Pure Pointer Programs and Tree Isomorphism -- A Language for Differentiable Functions -- Computing Quantiles in Markov Reward Models -- Parameterized Weighted Containment -- Weighted Specifications over Nested Words -- An Algebraic Presentation of Predicate Logic -- Strategies as Profunctors -- Generalised Name Abstraction for Nominal Sets. |
| Record Nr. | UNINA-9910741163103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Generative Programming and Component Engineering : Second International Conference, GPCE 2003, Erfurt, Germany, September 22-25, 2003, Proceedings / / edited by Frank Pfenning, Yannis Smaragdakis
| Generative Programming and Component Engineering : Second International Conference, GPCE 2003, Erfurt, Germany, September 22-25, 2003, Proceedings / / edited by Frank Pfenning, Yannis Smaragdakis |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (IX, 397 p.) |
| Disciplina | 005.11 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Application software Management information systems Computer science Software Engineering/Programming and Operating Systems Software Engineering Programming Techniques Programming Languages, Compilers, Interpreters Computer Appl. in Administrative Data Processing Management of Computing and Information Systems |
| ISBN | 3-540-39815-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Domain-Specific Languages -- Spidle: A DSL Approach to Specifying Streaming Applications -- TDL: A Hardware Description Language for Retargetable Postpass Optimizations and Analyses -- Hume: A Domain-Specific Language for Real-Time Embedded Systems -- Staged Programming -- Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection -- On Stage Ordering in Staged Computation -- Staged Notational Definitions -- Invited Talk -- A Journey from Interpreters to Compilers and Virtual Machines -- Modeling to Code -- DAOP-ADL: An Architecture Description Language for Dynamic Component and Aspect-Based Development -- ANEMIC: Automatic Interface Enabler for Model Integrated Computing -- Aspect-Orientation -- An Approach for Supporting Aspect-Oriented Domain Modeling -- The Convergence of AOP and Active Databases: Towards Reactive Middleware -- A Selective, Just-in-Time Aspect Weaver -- Meta-programming and Language Extension -- An Extension to the Subtype Relationship in C++ Implemented with Template Metaprogramming -- Concept-Controlled Polymorphism -- Component-Based DSL Development -- Invited Talk -- Towards a More Piece-ful World -- Automating Design-to-Code Transitions -- A Generative Approach to Framework Instantiation -- Making Patterns Explicit with Metaprogramming -- Principled Domain-Specific Approaches -- Generating Spreadsheet-Like Tools from Strong Attribute Grammars -- SynchNet: A Petri Net Based Coordination Language for Distributed Objects -- Partial Evaluation of MATLAB -- Generation and Translation -- An Easy-to-Use Toolkit for Efficient Java Bytecode Translators -- A Case for Test-Code Generation in Model-Driven Systems. |
| Altri titoli varianti | GPCE '03 |
| Record Nr. | UNINA-9910144042103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Generative Programming and Component Engineering : Second International Conference, GPCE 2003, Erfurt, Germany, September 22-25, 2003, Proceedings / / edited by Frank Pfenning, Yannis Smaragdakis
| Generative Programming and Component Engineering : Second International Conference, GPCE 2003, Erfurt, Germany, September 22-25, 2003, Proceedings / / edited by Frank Pfenning, Yannis Smaragdakis |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (IX, 397 p.) |
| Disciplina | 005.11 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Application software Management information systems Computer science Software Engineering/Programming and Operating Systems Software Engineering Programming Techniques Programming Languages, Compilers, Interpreters Computer Appl. in Administrative Data Processing Management of Computing and Information Systems |
| ISBN | 3-540-39815-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Domain-Specific Languages -- Spidle: A DSL Approach to Specifying Streaming Applications -- TDL: A Hardware Description Language for Retargetable Postpass Optimizations and Analyses -- Hume: A Domain-Specific Language for Real-Time Embedded Systems -- Staged Programming -- Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection -- On Stage Ordering in Staged Computation -- Staged Notational Definitions -- Invited Talk -- A Journey from Interpreters to Compilers and Virtual Machines -- Modeling to Code -- DAOP-ADL: An Architecture Description Language for Dynamic Component and Aspect-Based Development -- ANEMIC: Automatic Interface Enabler for Model Integrated Computing -- Aspect-Orientation -- An Approach for Supporting Aspect-Oriented Domain Modeling -- The Convergence of AOP and Active Databases: Towards Reactive Middleware -- A Selective, Just-in-Time Aspect Weaver -- Meta-programming and Language Extension -- An Extension to the Subtype Relationship in C++ Implemented with Template Metaprogramming -- Concept-Controlled Polymorphism -- Component-Based DSL Development -- Invited Talk -- Towards a More Piece-ful World -- Automating Design-to-Code Transitions -- A Generative Approach to Framework Instantiation -- Making Patterns Explicit with Metaprogramming -- Principled Domain-Specific Approaches -- Generating Spreadsheet-Like Tools from Strong Attribute Grammars -- SynchNet: A Petri Net Based Coordination Language for Distributed Objects -- Partial Evaluation of MATLAB -- Generation and Translation -- An Easy-to-Use Toolkit for Efficient Java Bytecode Translators -- A Case for Test-Code Generation in Model-Driven Systems. |
| Altri titoli varianti | GPCE '03 |
| Record Nr. | UNISA-996465798703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic Programming and Automated Reasoning [[electronic resource] ] : 5th International Conference, LPAR '94, Kiev, Ukraine, July 16 - 22, 1994. Proceedings / / edited by Frank Pfenning
| Logic Programming and Automated Reasoning [[electronic resource] ] : 5th International Conference, LPAR '94, Kiev, Ukraine, July 16 - 22, 1994. Proceedings / / edited by Frank Pfenning |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XII, 352 p.) |
| Disciplina | 005.1/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Architecture, Computer
Programming languages (Electronic computers) Computers Artificial intelligence Computer programming Mathematical logic Computer System Implementation Programming Languages, Compilers, Interpreters Theory of Computation Artificial Intelligence Programming Techniques Mathematical Logic and Formal Languages |
| ISBN | 3-540-48573-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Generalization and reuse of tactic proofs -- Program tactics and logic tactics -- On the relation between the ??-calculus and the syntactic theory of sequential control -- On a proof-theoretical analysis of ? 1 1 -AC, ? 1 1 -DC and ? 1 1 -CA -- Proof plans for the correction of false conjectures -- On the value of antiprenexing -- Implementing a finite-domain CLP-language on top of Prolog: a transformational approach -- RISC-CLP(CF) constraint logic programming over complex functions -- Logical closures -- Higher-order rigid E-unification -- Program extraction in a Logical Framework setting -- Higher-Order Abstract Syntax with induction in Coq -- Towards efficient calculi for resource-oriented deductive planning -- A logic programming framework for the abductive inference of intentions in cooperative dialogues -- Constraint logic programming in the sequent calculus -- On conditional rewrite systems with extra variables and deterministic logic programs -- A bottom-up reconstruction of the well-founded semantics for disjunctive logic programs -- An efficient computation of the extended generalized closed world assumption by support-for-negation sets -- Multi-SLD resolution -- On anti-links -- A generic declarative diagnoser for normal logic programs -- Goal dependent vs. goal independent analysis of logic programs -- A kind of achievement by parts method -- Projection in temporal logic programming. |
| Record Nr. | UNISA-996465978103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Term Rewriting and Applications [[electronic resource] ] : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings / / edited by Frank Pfenning
| Term Rewriting and Applications [[electronic resource] ] : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings / / edited by Frank Pfenning |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 418 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Compilers (Computer programs)
Machine theory Computer science Artificial intelligence Computer science—Mathematics Compilers and Interpreters Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Artificial Intelligence Symbolic and Algebraic Manipulation |
| ISBN | 3-540-36835-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FLoC Plenary Talk -- Formal Verification of Infinite State Systems Using Boolean Methods -- Session 1. Constraints and Optimization -- Solving Partial Order Constraints for LPO Termination -- Computationally Equivalent Elimination of Conditions -- On the Correctness of Bubbling -- Propositional Tree Automata -- Session 2. Equational Reasoning -- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems -- Unions of Equational Monadic Theories -- Modular Church-Rosser Modulo -- Session 3. System Verification -- Hierarchical Combination of Intruder Theories -- Feasible Trace Reconstruction for Rewriting Approximations -- Invited Talk -- Rewriting Models of Boolean Programs -- Session 4. Lambda Calculus -- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ?-Calculus -- A Terminating and Confluent Linear Lambda Calculus -- A Lambda-Calculus with Constructors -- Structural Proof Theory as Rewriting -- Session 5. Theorem Proving -- Checking Conservativity of Overloaded Definitions in Higher-Order Logic -- Certified Higher-Order Recursive Path Ordering -- Dealing with Non-orientable Equations in Rewriting Induction -- Session 6. System Descriptions -- TPA: Termination Proved Automatically -- RAPT: A Program Transformation System Based on Term Rewriting -- The CL-Atse Protocol Analyser -- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker -- Invited Talk -- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages -- Session 7. Termination -- Predictive Labeling -- Termination of String Rewriting with Matrix Interpretations -- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems -- Proving Positive Almost Sure Termination Under Strategies -- Session 8. Higher-Order Rewriting and Unification -- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property -- Higher-Order Orderings for Normal Rewriting -- Bounded Second-Order Unification Is NP-Complete. |
| Record Nr. | UNISA-996465591603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Term Rewriting and Applications [[electronic resource] ] : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings / / edited by Frank Pfenning
| Term Rewriting and Applications [[electronic resource] ] : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings / / edited by Frank Pfenning |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 418 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Compilers (Computer programs)
Machine theory Computer science Artificial intelligence Computer science—Mathematics Compilers and Interpreters Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Artificial Intelligence Symbolic and Algebraic Manipulation |
| ISBN | 3-540-36835-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FLoC Plenary Talk -- Formal Verification of Infinite State Systems Using Boolean Methods -- Session 1. Constraints and Optimization -- Solving Partial Order Constraints for LPO Termination -- Computationally Equivalent Elimination of Conditions -- On the Correctness of Bubbling -- Propositional Tree Automata -- Session 2. Equational Reasoning -- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems -- Unions of Equational Monadic Theories -- Modular Church-Rosser Modulo -- Session 3. System Verification -- Hierarchical Combination of Intruder Theories -- Feasible Trace Reconstruction for Rewriting Approximations -- Invited Talk -- Rewriting Models of Boolean Programs -- Session 4. Lambda Calculus -- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ?-Calculus -- A Terminating and Confluent Linear Lambda Calculus -- A Lambda-Calculus with Constructors -- Structural Proof Theory as Rewriting -- Session 5. Theorem Proving -- Checking Conservativity of Overloaded Definitions in Higher-Order Logic -- Certified Higher-Order Recursive Path Ordering -- Dealing with Non-orientable Equations in Rewriting Induction -- Session 6. System Descriptions -- TPA: Termination Proved Automatically -- RAPT: A Program Transformation System Based on Term Rewriting -- The CL-Atse Protocol Analyser -- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker -- Invited Talk -- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages -- Session 7. Termination -- Predictive Labeling -- Termination of String Rewriting with Matrix Interpretations -- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems -- Proving Positive Almost Sure Termination Under Strategies -- Session 8. Higher-Order Rewriting and Unification -- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property -- Higher-Order Orderings for Normal Rewriting -- Bounded Second-Order Unification Is NP-Complete. |
| Record Nr. | UNINA-9910483179803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||