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.
Transactions on Computational Systems Biology VI [[electronic resource] /] / edited by Gordon Plotkin
| Transactions on Computational Systems Biology VI [[electronic resource] /] / edited by Gordon Plotkin |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (VII, 247 p.) |
| Disciplina | 004.0151 |
| Collana | Transactions on Computational Systems Biology |
| Soggetto topico |
Computers
Life sciences Bioinformatics Mathematical logic Algorithms Theory of Computation Life Sciences, general Computation by Abstract Devices Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-46236-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Property-Driven Statistics of Biological Networks -- On the Computational Power of Brane Calculi -- Analysis of Signalling Pathways Using Continuous Time Markov Chains -- Machine Learning Biochemical Networks from Temporal Logic Properties -- Qualitative Petri Net Modelling of Genetic Networks -- Simulating Bacterial Transcription and Translation in a Stochastic ? Calculus -- Automated Abstraction Methodology for Genetic Regulatory Networks -- P Systems, a New Computational Modelling Tool for Systems Biology -- Equivalence of Metabolite Fragments and Flow Analysis of Isotopomer Distributions for Flux Estimation -- Multiple Representations of Biological Processes. |
| Record Nr. | UNISA-996466158903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Typed Lambda Calculi and Applications [[electronic resource] ] : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, April 10 - 12, 1995. Proceedings / / edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin
| Typed Lambda Calculi and Applications [[electronic resource] ] : Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, April 10 - 12, 1995. Proceedings / / edited by Mariangiola Dezani-Ciancaglini, Gordon Plotkin |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (VIII, 452 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Computer logic Computer programming Theory of Computation Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Techniques |
| ISBN | 3-540-49178-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Comparing ?-calculus translations in sharing graphs -- Extensions of pure type systems -- A model for formal parametric polymorphism: A per interpretation for system R -- A realization of the negative interpretation of the Axiom of Choice -- Using subtyping in program optimization -- What is a categorical model of Intuitionistic Linear Logic? -- An explicit Eta rewrite rule -- Extracting text from proofs -- Higher-order abstract syntax in Coq -- Expanding extensional polymorphism -- Lambda-calculus, combinators and the comprehension scheme -- ??-Equality for coproducts -- Typed operational semantics -- A simple calculus of exception handling -- A simple model for quotient types -- Untyped ?-calculus with relative typing -- Final semantics for untyped ?-calculus -- A simplification of Girard's paradox -- Basic properties of data types with inequational refinements -- Decidable properties of intersection type systems -- Termination proof of term rewriting system with the multiset path ordering. A complete development in the system Coq -- Typed ?-calculi with explicit substitutions may not terminate -- On equivalence classes of interpolation equations -- Strict functionals for termination proofs -- A verified typechecker -- Categorical semantics of the call-by-value ?-calculus -- A fully abstract translation between a ?-calculus with reference types and Standard ML -- Categorical completeness results for the simply-typed lambda-calculus -- Third-order matching in the presence of type constructors. |
| Record Nr. | UNISA-996466100403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||