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.
Rewriting, Computation and Proof [[electronic resource] ] : Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner
| Rewriting, Computation and Proof [[electronic resource] ] : Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner |
| Autore | Comon Hubert |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 276 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Compilers (Computer programs) Computer programming Software engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Programming Techniques Software Engineering |
| ISBN | 3-540-73147-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Rewriting Foundations -- The Hydra Battle Revisited -- Orderings and Constraints: Theory and Practice of Proving Termination -- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations -- Computability Closure: Ten Years Later -- Reduction Strategies and Acyclicity -- Proof and Computation -- Towards Rewriting in Coq -- Superdeduction at Work -- Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic ?-Calculus -- Linear Recursive Functions -- Towards Safety and Security -- Deducibility Constraints, Equational Theory and Electronic Money -- Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms -- Towards Modular Algebraic Specifications for Pointer Programs: A Case Study -- Modeling Permutations in Coq for Coccinelle. |
| Record Nr. | UNISA-996466253303316 |
Comon Hubert
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Rewriting, Computation and Proof : Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner
| Rewriting, Computation and Proof : Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner |
| Autore | Comon Hubert |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 276 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Compilers (Computer programs) Computer programming Software engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Programming Techniques Software Engineering |
| ISBN | 3-540-73147-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Rewriting Foundations -- The Hydra Battle Revisited -- Orderings and Constraints: Theory and Practice of Proving Termination -- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations -- Computability Closure: Ten Years Later -- Reduction Strategies and Acyclicity -- Proof and Computation -- Towards Rewriting in Coq -- Superdeduction at Work -- Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic ?-Calculus -- Linear Recursive Functions -- Towards Safety and Security -- Deducibility Constraints, Equational Theory and Electronic Money -- Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms -- Towards Modular Algebraic Specifications for Pointer Programs: A Case Study -- Modeling Permutations in Coq for Coccinelle. |
| Record Nr. | UNINA-9910483171803321 |
|
Comon Hubert
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||