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.
Semantics and Algebraic Specification [[electronic resource] ] : Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday / / edited by Jens Palsberg
| Semantics and Algebraic Specification [[electronic resource] ] : Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday / / edited by Jens Palsberg |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 409 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Software engineering Compilers (Computer programs) Computer science Machine theory Programming Techniques Software Engineering Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
| ISBN | 3-642-04164-7 |
| Classificazione |
DAT 510f
DAT 557f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tribute to Peter Mosses -- Action Semantics in Retrospect -- Component-Based Security Policy Design with Colored Petri Nets -- Order-Sorted Parameterization and Induction -- An Implementation of Object-Oriented Action Semantics in Maude -- A Constructive Semantics for Basic Aspect Constructs -- Structural Operational Semantics for Weighted Transition Systems -- On the Specification and Verification of Model Transformations -- Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines -- Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines -- Type Checking Evolving Languages with MSOS -- Action Algebras and Model Algebras in Denotational Semantics -- Mobile Processes and Termination -- An Action Semantics Based on Two Combinators -- Converting between Combinatory Reduction Systems and Big Step Semantics -- Model-Based Testing and the UML Testing Profile -- A Complete, Co-inductive Syntactic Theory of Sequential Control and State -- Vertical Object Layout and Compression for Fixed Heaps. |
| Record Nr. | UNISA-996465292903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Semantics and algebraic specification : essays dedicated to Peter D. Mosses on the occasion of his 60th birthday / / Jens Palsberg (ed.)
| Semantics and algebraic specification : essays dedicated to Peter D. Mosses on the occasion of his 60th birthday / / Jens Palsberg (ed.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (X, 409 p.) |
| Disciplina | 004 |
| Altri autori (Persone) | PalsbergJens |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Abstract data types (Computer science)
Algebra Semantics |
| ISBN | 3-642-04164-7 |
| Classificazione |
DAT 510f
DAT 557f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tribute to Peter Mosses -- Action Semantics in Retrospect -- Component-Based Security Policy Design with Colored Petri Nets -- Order-Sorted Parameterization and Induction -- An Implementation of Object-Oriented Action Semantics in Maude -- A Constructive Semantics for Basic Aspect Constructs -- Structural Operational Semantics for Weighted Transition Systems -- On the Specification and Verification of Model Transformations -- Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines -- Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines -- Type Checking Evolving Languages with MSOS -- Action Algebras and Model Algebras in Denotational Semantics -- Mobile Processes and Termination -- An Action Semantics Based on Two Combinators -- Converting between Combinatory Reduction Systems and Big Step Semantics -- Model-Based Testing and the UML Testing Profile -- A Complete, Co-inductive Syntactic Theory of Sequential Control and State -- Vertical Object Layout and Compression for Fixed Heaps. |
| Record Nr. | UNINA-9910483541703321 |
| Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Types for Proofs and Programs [[electronic resource] ] : International Conference, TYPES 2008 Torino, Italy, March 26-29, 2008 Revised Selected Papers / / edited by Stefano Berardi, Ferruccio Damiani, Ugo de Liguoro
| Types for Proofs and Programs [[electronic resource] ] : International Conference, TYPES 2008 Torino, Italy, March 26-29, 2008 Revised Selected Papers / / edited by Stefano Berardi, Ferruccio Damiani, Ugo de Liguoro |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (VIII, 323 p.) |
| Disciplina | 005.13122gerDNB |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer science Machine theory Compilers (Computer programs) Computer science—Mathematics Artificial intelligence Programming Techniques Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-642-02444-0 |
| Classificazione |
DAT 373f
DAT 510f DAT 706f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Type Inference by Coinductive Logic Programming -- About the Formalization of Some Results by Chebyshev in Number Theory -- A New Elimination Rule for the Calculus of Inductive Constructions -- A Framework for the Analysis of Access Control Models for Interactive Mobile Devices -- Proving Infinitary Normalization -- First-Class Object Sets -- Monadic Translation of Intuitionistic Sequent Calculus -- Towards a Type Discipline for Answer Set Programming -- Type Inference for a Polynomial Lambda Calculus -- Local Theory Specifications in Isabelle/Isar -- Axiom Directed Focusing -- A Type System for Usage of Software Components -- Merging Procedural and Declarative Proof -- Using Structural Recursion for Corecursion -- Manifest Fields and Module Mechanisms in Intensional Type Theory -- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq -- Coalgebraic Reasoning in Coq: Bisimulation and the ?-Coiteration Scheme -- A Process-Model for Linear Programs -- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. |
| Record Nr. | UNISA-996465856203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Types for proofs and programs : international conference, TYPES 2008, Torino, Italy, March 26-29, 2008 : revised selected papers / / Stefano Berardi, Ferruccio Damiani, Ugo de'Liguoro (eds.)
| Types for proofs and programs : international conference, TYPES 2008, Torino, Italy, March 26-29, 2008 : revised selected papers / / Stefano Berardi, Ferruccio Damiani, Ugo de'Liguoro (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer, c2009 |
| Descrizione fisica | 1 online resource (VIII, 323 p.) |
| Disciplina | 005.13122gerDNB |
| Altri autori (Persone) |
BerardiStefano
DamianiFerruccio De'LiguoroUgo |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Automatic theorem proving
Computer programming |
| ISBN | 3-642-02444-0 |
| Classificazione |
DAT 373f
DAT 510f DAT 706f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Type Inference by Coinductive Logic Programming -- About the Formalization of Some Results by Chebyshev in Number Theory -- A New Elimination Rule for the Calculus of Inductive Constructions -- A Framework for the Analysis of Access Control Models for Interactive Mobile Devices -- Proving Infinitary Normalization -- First-Class Object Sets -- Monadic Translation of Intuitionistic Sequent Calculus -- Towards a Type Discipline for Answer Set Programming -- Type Inference for a Polynomial Lambda Calculus -- Local Theory Specifications in Isabelle/Isar -- Axiom Directed Focusing -- A Type System for Usage of Software Components -- Merging Procedural and Declarative Proof -- Using Structural Recursion for Corecursion -- Manifest Fields and Module Mechanisms in Intensional Type Theory -- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq -- Coalgebraic Reasoning in Coq: Bisimulation and the ?-Coiteration Scheme -- A Process-Model for Linear Programs -- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. |
| Altri titoli varianti | TYPES 2007 |
| Record Nr. | UNINA-9910483948103321 |
| Berlin ; ; Heidelberg, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
