Info
Foundations of software science and computation structures : 4th International Conference, FOSSACS 2001, held as part of the Joint European Conference on Theory and Practice of Software, ETAPS 2001, Genova, Italy, April 2-6, 2001 : proceedings / / Furio Honsell, Marino Miculan (Editors)
| Foundations of software science and computation structures : 4th International Conference, FOSSACS 2001, held as part of the Joint European Conference on Theory and Practice of Software, ETAPS 2001, Genova, Italy, April 2-6, 2001 : proceedings / / Furio Honsell, Marino Miculan (Editors) |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2001] |
| Descrizione fisica | 1 online resource (XII, 420 p.) |
| Disciplina | 005.453 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
System analysis
Computer software |
| ISBN | 3-540-45315-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- Adequacy for Algebraic Effects -- Contributed Papers -- Secrecy Types for Asymmetric Communication -- Axiomatizing Tropical Semirings -- Type Isomorphisms and Proof Reuse in Dependent Type Theory -- On the Duality between Observability and Reachability -- The Finite Graph Problem for Two-Way Alternating Automata -- High-Level Petri Nets as Type Theories in the Join Calculus -- Temporary Data in Shared Dataspace Coordination Languages -- On Garbage and Program Logic -- The Complexity of Model Checking Mobile Ambients -- The Rho Cube -- Type Inference with Recursive Type Equations -- On the Modularity of Deciding Call-by-Need -- Synchronized Tree Languages Revisited and New Applications -- Computational Completeness of Programming Languages Based on Graph Transformation -- Axioms for Recursion in Call-by-Value -- Class Analysis of Object-Oriented Programs through Abstract Interpretation -- On the Complexity of Parity Word Automata -- Foundations for a Graph-Based Approach to the Specification of Access Control Policies -- Categories of Processes Enriched in Final Coalgebras -- Model Checking CTL+ and FCTL Is Hard -- On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory -- Verified Bytecode Verifiers -- Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the ?-Calculus and Mechanizing the Theory of Contexts -- Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes -- An Axiomatic Semantics for the Synchronous Language Gentzen -- Tool Presentation -- Marrella and the Verification of an Embedded System. |
| Record Nr. | UNISA-996465774103316 |
| Berlin, Germany : , : Springer, , [2001] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures : 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings / / edited by Furio Honsell, Marino Miculan
| Foundations of Software Science and Computation Structures : 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings / / edited by Furio Honsell, Marino Miculan |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 420 p.) |
| Disciplina | 005.453 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer science Machine theory Compilers (Computer programs) Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Theory of Computation Compilers and Interpreters |
| ISBN | 3-540-45315-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- Adequacy for Algebraic Effects -- Contributed Papers -- Secrecy Types for Asymmetric Communication -- Axiomatizing Tropical Semirings -- Type Isomorphisms and Proof Reuse in Dependent Type Theory -- On the Duality between Observability and Reachability -- The Finite Graph Problem for Two-Way Alternating Automata -- High-Level Petri Nets as Type Theories in the Join Calculus -- Temporary Data in Shared Dataspace Coordination Languages -- On Garbage and Program Logic -- The Complexity of Model Checking Mobile Ambients -- The Rho Cube -- Type Inference with Recursive Type Equations -- On the Modularity of Deciding Call-by-Need -- Synchronized Tree Languages Revisited and New Applications -- Computational Completeness of Programming Languages Based on Graph Transformation -- Axioms for Recursion in Call-by-Value -- Class Analysis of Object-Oriented Programs through Abstract Interpretation -- On the Complexity of Parity Word Automata -- Foundations for a Graph-Based Approach to the Specification of Access Control Policies -- Categories of Processes Enriched in Final Coalgebras -- Model Checking CTL+ and FCTL Is Hard -- On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory -- Verified Bytecode Verifiers -- Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the ?-Calculus and Mechanizing the Theory of Contexts -- Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes -- An Axiomatic Semantics for the Synchronous Language Gentzen -- Tool Presentation -- Marrella and the Verification of an Embedded System. |
| Record Nr. | UNINA-9910143597603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the Workshop on Logical Frameworks and Meta-Languages : Theory and Practice : held in Oxford on 2017-09-08 at the Conference on Formal Structures for Computation and Deduction / / organizers and program chairs, Marino Miculan, Florian Rabe
| Proceedings of the Workshop on Logical Frameworks and Meta-Languages : Theory and Practice : held in Oxford on 2017-09-08 at the Conference on Formal Structures for Computation and Deduction / / organizers and program chairs, Marino Miculan, Florian Rabe |
| Pubbl/distr/stampa | New York : , : ACM, , 2017 |
| Descrizione fisica | 1 online resource (27 pages) |
| Disciplina | 005.115 |
| Collana | ACM International Conference Proceedings Series |
| Soggetto topico |
Logic programming
Logic, Symbolic and mathematical |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
LFMTP '17 : proceedings of the Workshop on Logical Frameworks and Meta-Languages : Theory and Practice
Logical Frameworks and Meta-Languages Theory and Practice 2017 |
| Record Nr. | UNINA-9910375856303321 |
| New York : , : ACM, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Types for Proofs and Programs [[electronic resource] ] : International Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers / / edited by Marino Miculan, Ivan Scagnetto, Furio Honsell
| Types for Proofs and Programs [[electronic resource] ] : International Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers / / edited by Marino Miculan, Ivan Scagnetto, Furio Honsell |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 203 p.) |
| Disciplina | 005.13/1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer science Machine theory Compilers (Computer programs) Computer science—Mathematics Artificial intelligence Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-540-68103-5 |
| Classificazione | 54.52 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic Equality in Heyting Arithmetic Modulo -- CoqJVM: An Executable Specification of the Java Virtual Machine Using Dependent Types -- Dependently Sorted Logic -- Finiteness in a Minimalist Foundation -- A Declarative Language for the Coq Proof Assistant -- Characterising Strongly Normalising Intuitionistic Sequent Terms -- Intuitionistic vs. Classical Tautologies, Quantitative Comparison -- In the Search of a Naive Type Theory -- Verification of the Redecoration Algorithm for Triangular Matrices -- A Logic for Parametric Polymorphism with Effects -- Working with Mathematical Structures in Type Theory -- On Normalization by Evaluation for Object Calculi -- Attributive Types for Proof Erasure. |
| Record Nr. | UNISA-996465609803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Types for proofs and programs : international conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007 : revised selected papers / / Marino Miculan, Ivan Scagnetto, Furio Honsell (eds.)
| Types for proofs and programs : international conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007 : revised selected papers / / Marino Miculan, Ivan Scagnetto, Furio Honsell (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2008 |
| Descrizione fisica | 1 online resource (VII, 203 p.) |
| Disciplina | 005.13/1 |
| Altri autori (Persone) |
MiculanMarino
ScagnettoIvan HonsellFurio |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Automatic theorem proving
Computer programming |
| ISBN | 3-540-68103-5 |
| Classificazione | 54.52 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic Equality in Heyting Arithmetic Modulo -- CoqJVM: An Executable Specification of the Java Virtual Machine Using Dependent Types -- Dependently Sorted Logic -- Finiteness in a Minimalist Foundation -- A Declarative Language for the Coq Proof Assistant -- Characterising Strongly Normalising Intuitionistic Sequent Terms -- Intuitionistic vs. Classical Tautologies, Quantitative Comparison -- In the Search of a Naive Type Theory -- Verification of the Redecoration Algorithm for Triangular Matrices -- A Logic for Parametric Polymorphism with Effects -- Working with Mathematical Structures in Type Theory -- On Normalization by Evaluation for Object Calculi -- Attributive Types for Proof Erasure. |
| Altri titoli varianti | TYPES 2007 |
| Record Nr. | UNINA-9910485038503321 |
| Berlin ; ; New York, : Springer, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||